- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 6, JUNE 2005 2121 Two-Dimensional Cluster-Correcting Codes
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 38, NO. 4, JULY 1992 1357 119497558976453, 153639718684011, 185427249719400,
- IEEE TRANSACTIONS ON lNFORMATlON THEORY,"OL. 3h,NO,4,,Ul.~ 1990 899 2) If(l;..,l>EC,
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 11, NOVEMBER 2006 4867 On the Stopping Redundancy of ReedMuller Codes
- IEEE TRANSACTIONSON INFORMATION THEORY, VOL. 41, NO. 1, JANUARY 1995 11 Constructions for Optimal Constant Weight
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO. 4, JULY 1997 1361 The Depth Distribution--A New
- IEEETRANSACTIONSON INFORMATION THEORY, VOL. 39, NO. 4, JULY 1993 J.L. Massey "Error bounds for tree codes,trellis codes,and convolu-
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-30, NO.4, JULY1984 611 515-534,1982.
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-30, NO. 5, SEPTEMBER 1984 705 Construction of de Bruijn Sequencesof
- 1308 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 34, NO. 5, SEPTEMBER 1988 Constructions for Perfect Maps and
- On the other hand, the effect of reservation overhead on New Lower Bounds for Constant Weight Codes maximum throughput is more profound. Fig. 9 shows S,,,, versus
- 1696 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 37, NO. 6, NOVEMBER 1991 It is easy to show that the series C,+,"-,r,(t,q)Z" is again [ll] P. Pouzet, "Etude en vue de leur traitement numerique des equa-
- For C, , 1(1,0) = 0 0 0 1 1 and I( 1,l) = 0 0 1 1 0, which indi-cates that C, is inserted between vector numbers 3 and 4 in L(2).
- IEEE TRANSACTIONSON INFORMATION THEORY, VOL. 39, NO. 1, JANUARY 1993 209 Consequently, at the right half evidently max{s/i (7, m)} >
- 754 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 40, NO. 3, MAY 1994 Perfect Binary Codes: Constructions,
- Designs, Codes and Cryptography, 5,217-239 (1995) 9 1995 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 42, NO. 3, MAY 1996 779 Near Optimal Single-Track Gray Codes
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO. 1, JANUARY 1997 319 [1] E. F. Assmus, Jr., and V. S. Pless, "On the covering radius of extremal
- 794 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 2, MARCH 1999 [1] J. D. Marca and N. Jayant, "An algorithm for assigning binary indices
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 6, SEPTEMBER 1999 2173 Which Codes Have Cycle-Free Tanner Graphs?
- 2188 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 6, SEPTEMBER 2000 we just use Theorem 2.6 in our tables. However, for even q, Theorem
- 428 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 Two-Dimensional Interleaving Schemes With
- 880 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 4, APRIL 2002 Improved Upper Bounds on Sizes of Codes
- 2156 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 9, SEPTEMBER 2004 Perfect Constant-Weight Codes
- Journal of Combinatorial Theory, Series A 113 (2006) 189224 www.elsevier.com/locate/jcta
- Configuration Distribution and Designs of Codes in the Johnson Scheme
- 1472 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 42, NO. 5, SEPTEMBER1996 A Method for Constructing
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 2, MARCH 1999 693 Proof of Theorem 1: Let xk = AkA0k. Then xk 2 f0;1g. The
- Advances in Mathematics of Communications Web site: http://www.aimSciences.org Volume 1, No. 2, 2007, 173195
- 382 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 1, JANUARY 1998 NEW OPTIMUM GOLOMB RULERS.
- 3140 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 7, NOVEMBER 1998 ACKNOWLEDGMENT
- SIAM J. DISCRETE MATH. c 2005 Society for Industrial and Applied Mathematics Vol. 18, No. 4, pp. 844878
- 3938 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 11, NOVEMBER 2005 Quasi-Perfect Codes With Small Distance
- 846 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 2, MARCH 1998 Efficient Encoding Algorithm for Third-Order
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2383 The Structure of Single-Track Gray Codes
- 3186 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 9, SEPTEMBER 2005 Zero/Positive Capacities of Two-Dimensional
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 6, SEPTEMBER 2001 2553 VI. CONCLUSION
- 480 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-30, NO.3, MAY 1984 However,this impliesthat Thereforewe havea setsplitting.
- 422 IEEETRANSACTIONSON INFORMATIONTHEORY,VOL. IT-32, NO. 3, MAY 1986 On the Distribution of de Bruijn CR-Sequences
- 5128 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 11, NOVEMBER 2006 The Positive Capacity Region of Two-Dimensional
- EISEVIER Discrete Applied Mathematics 70 (1996) 163-175 MATHEMATICS
