Constructions of Binary Constant-Weight Cyclic Codes and Cyclically Permutable Codes

IEEE Transactions on Information Theory

Volumn 38, Issue 3, 1992, Pages 940-949

  Massey, James L ^b   Gyorfi, Laszlo ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b ETH ZURICH   (Switzerland)

Author keywords

codes; Collision channel; constant weight codes; cyclic; cyclically permutable codes; maximum distance separable codes; protocol sequences; Reed Solomon codes

Indexed keywords

BERLEKAMP-JUSTESEN CODES; CODE CONSTRUCTION; CYCLIC CODES; PERMUTABLE CODES; REED-SOLOMON CODES;

CODES, SYMBOLIC;

EID: 0026866185     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.135636     Document Type: Article

References (22)

1. E. N. Gilbert, “Cyclically permutable error-correcting codes,” IEEE Trans. Inform. Theory, vol. 9, 175–182, 1963.
2. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1984.
3. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam: North-Holland, 1977.
4. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA: M.I.T. Press, 1972.
5. V. A. Zinoviev, “Cascade equal-weight codes and maximal packing,” Probl. Contr. Inform. Theory, vol. 12, pp. 3–9, 1983.
6. G. Einarsson, “Address assignment for a time-frequency-coded spread-spectrum system,” Bell Syst. Tech. J., vol. 59, pp. 1241–1255, Sept. 1980.
7. W. H. Kautz and R. C. Singleton, “Nonrandom binary superimposed codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 363–377, Oct. 1964.
8. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications, vol. I. Rockville, MD: Computer Science Press, 1985.
9. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 4th ed. London: Oxford Univ. Press, 1960.
10. A. N. Boehmer, “Binary pulse compression codes,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 156–167, Apr. 1967.
11. R. Turyn, “Optimum codes study,” Sylvania Electron. Syst., final rep., Contract AF19(604)-5473, Jan. 29, 1960.
12. 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, Nov. 1990.
13. E. R. Berlekamp and J. Justesen, “Some long cyclic linear binary codes are not so bad,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 351–356, May 1974.
14. V. C. da Rocha, Jr., Maximum distance separable multilevel codes,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 547–548, May 1984.
15. D. E. Maracle and C. T. Wolverton, “Generating cyclically permutable codes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 554–555, July 1974.
16. P. G. Neumann, “On a class of cyclically permutable error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 75–78, Jan. 1964.
17. I. Vajda and G. Einarsson, “Code acquisition for a frequency-hopping system,” IEEE Trans. Commun., vol. COM-35, pp. 566–568, May 1987.
18. J. L. Massey, “The capacity of the collision channel without feedback,” Abstracts of Papers, IEEEInt. Symp. Inform. Theory, p. 101, 1982.
19. J. L. Massey and P. Mathys, “The collision channel without feedback,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 192–204, March 1985.
20. B. S. Tsybakov and N. B. Likhanov, “Packet Communication on a channel without feedback,” Probl. Inform. Transm., vol. XIX, no. 2, 69–84, 1983.
21. L. A. Bassalygo and M. S. Pinsker, “Limited multiple-access of a nonsynchronous channel,” (in Russian) Probl. Inform. Transm., vol. XIX, no. 4, pp. 92–96, 1983.
22. S. W. Golomb, B. Gordon, and L. R. Welch, “Comma-free codes,” Canadian J. Math., vol. 10, pp. 202–209, 1958.