Constructions for Optimal Constant Weight Cyclically Permutable Codes and Difference Families

IEEE Transactions on Information Theory

Volumn 41, Issue 1, 1995, Pages 77-87

  Bitan, Sara ^a   Etzion, Tuvi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

constant weight codes; cosets of groups; Cyclically permutable codes; difference arrays; difference families; uniform codes

Indexed keywords

BINARY CODES; CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; ENCODING (SYMBOLS);

CONSTANT WEIGHT CODES; COSETS OF GROUPS; CYCLIC PERMUTABLE CODES; DIFFERENCE ARRAYS; DIFFERENCE FAMILIES; UNIFORM CODES;

INFORMATION THEORY;

EID: 0029235101     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370117     Document Type: Article

References (34)

1. N. Q. A., L. Gyorfi, and J. L. Massey, “Constructions of binary constant-weight cyclic codes and cyclically permutable codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 940–949, May 1992.
2. J. Abrham, “Perfect systems of difference sets—A survey,” Ars Combinatoria, vol. 17A, pp. 5–36, 1984.
3. S. Bitan and T. Etzion, “The last packing number of quadruples and cyclic SQS,” Des., Codes Cryptogr., vol. 3, pp. 283–313, 1993.
4. R. C. Bose and K. A. Bush, “Orthogonal arrays of strength two and three,” Ann. Math. Stat., vol. 23, no. 4, pp. 508–524, 1952.
5. R. C. Bose, “On the construction of balanced incomplete block designs,” Ann. Eugenics, vol. 9, pp. 353–399, 1939.
6. E. F. Brickell and V. K. Wei, “Optical orthogonal codes and difference families,” in Proc. Southeastern Conf. on Combinatorics Graph Theory and Algorithms, 1987.
7. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, “A new table of constant weight codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 1334–1380, 1990.
8. R. H. Bruck and H. J. Ryser, “The nonexistence of certain finite projective planes,” Canadian J. Math., vol. 1, pp. 88–93, 1949.
9. M. Buratti, “Improving two Bose's theorems on difference families,” to appear in J. Comb. Des., 1993.
10. —, “Simple radical difference families in Galois fields,” presented at the 14th British Combinatorial Conf., July 1993.
11. A. T. Butson, “Generalized Hadamard matrices,” Proc. Amer. Math. Soc., pp. 894–898, 1962.
12. F. R. K. Chung, J. A. Salehi, and V. K. Wei, “Optical orthogonal codes: Design, analysis, and applications,” IEEE Trans. Inform. Theory, vol. 35, no. 3, pp. 595–604, May 1989.
13. H. Chung and P. V. Kumar, “Optical orthogonal codes—New bounds and an optimal construction,” IEEE Trans. Inform. Theory, vol. 36, no. 4, pp. 866–873, July 1990.
14. M. J. Colbourn and C. J. Colbourn, “On cyclic block designs,” Math. Rep. Canadian Acad. Sci., vol. 2, pp. 21–26, 1980.
15. M. J. Colbourn and R. A. Mathon, “On cyclic Steiner 2-designs,” Ann. Discrete Math., vol. 7, pp. 215–235, 1980.
16. J. Denes and A. D. Keedwell, Latin Squares and their Applications. New York: Academic Press, 1974.
17. E. N. Gilbert, “Cyclically permutable error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 175–182, July 1963.
18. S. W. Golomb and E. C. Posner, “Rook domains, latin squares, affine planes, and error-distributed codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 196–208, 1965.
19. S. W. Golomb, Digital Communication with Space Application. Englewood Cliffs, NJ: Prentice-Hall. Los Altos, CA: Peninsula Publishing, 1982, 2nd, ed., 1964.
20. M. Jimbo and S. Kuriki, “On a composition of cyclic Steiner 2-designs,” Discrete Math., vol. 46, pp. 249–255, 1983.
21. F. J. Macwilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
22. J. L. Massey and P. Mathys, “The collision channel without feedback,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 192–204, Mar. 1985.
23. R. Mathon, “Constructions for cyclic Steiner 2-designs,” Ann. Discrete Math., vol. 34, pp. 353–362, 1987.
24. O. Moreno and V. A. Zinoviev, “On cyclic constant weight codes,” preprint, 1993.
25. I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, 4th ed. New York: Wiley, 1980.
26. P. V. Kumar, O. Moreno, Z. Zhang, and V. A. Zionviev, “New constructions of optimal cyclically permutable and constant weight codes,” to appear in IEEE Trans. Inform. Theory, 1993.
27. G. H. van Rees, P. J. Schellenberg, and S. A. Vanstone, “Four pairwise orthogonal latin squares of order 15,” Ars Combinatoria, vol. 6, pp. 141–150, 1978.
28. K. T. Phelps and A. Rosa, “Steiner triple systems with rotational automorphisms,” Discrete Math., vol. 33, pp. 57–66, 1981.
29. M. Plotkin, “Binary codes with specified minimum distances,” IEEE Trans. Inform. Theory, vol. IT-6, pp. 445–450, 1960.
30. J. H. van Lint, R. J. M. Vaessens, and E. H. L. Aarts, “Genetic algorithms in coding theory—A table for i3 (n, d),” Discrete Appl. Math., vol. 45, no. 1, pp. 71–87, Aug. 93.
31. N. V. Semakov, V. A. Zinov'ev, and G. V. Zaitsev, “A class of maximum equidistant codes,” Probl. Pered. Inform., vol. 5, no. 2, pp. 84–87, 1969.
32. S. S. Shrikhande, “Generalized Hadamard matrices and orthogonal arrays of strength two,” Canadian J. Math., vol. 16, no. 4, pp. 736–740, 1964.
33. R. M. Wilson, “Cyclotomy and difference families in elementary abelian groups,” J. Number Theory, vol. 4, pp. 17–47, 1972.
34. C. F. Woodcock, “Note on orthogonal latin squares,” J Comb. Theory Ser. A, vol. 43, pp. 146–148, 1986.