Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1255, Issue , 1997, Pages 341-352

  Xia, Shutao ^a   Fu, Fangwei ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; EQUIVALENCE CLASSES;

ALGEBRAIC CONSTRUCTIONS; COLLISION CHANNELS; CONSTANT WEIGHT; CYCLIC CODE; SEQUENCE SET;

CODES (SYMBOLS);

EID: 84957811063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63163-1_27     Document Type: Conference Paper

References (17)

1. N.Q.A, L. Györfi, and J.L. Massey. “Constructions of binary constant-weight cyclic codes”, IEEE Trans. Inform. Theory, 1992, 38(3): 940-949.
2. H. Song, I. Reed, S. Golomb. “On the nonperiodic cyclic equivalence classes of Reed-Solomon codes,” IEEE Trans, on Inform. Theory, 1993, 39(4): 1431-1434.
3. L. Györfi, I. Vajda. “Constructions of protocol sequence for multiple access collision channel without feedback,” IEEE Trans, on Inform. Theory, 1993, 39(5): 1762-1765.
4. N.Q.A, “Families of sequences with optimal generalized Hamming correlation properties,” Problems of Control and Information Theory, 1988, 17(3): 117-123.
5. E.N. Gilbert. “Cyclically permutable error-correcting codes,” IEEE Trans, on Inform. Theory, vol, 9, pp.175-182, July 1963.
6. E.R. Berlekamp and J. Justesen. “Some long cyclic linear binary codes are not so bad,” IEEE Trans, on Inform. Theory, vol. 20, pp.351-356, May 1974.
7. C. Koscielny. “Constructing a better cyclic code than cyclic Reed-Solomon code,” IEEE Trans, on Inform, theory, 1995, 41(4): 1191-1194.
8. A.W. Lam and D.V. Sarwate. “Time-hopping and frequency-hopping multiple-acces packet communications,” IEEE Trans, on Commun., 1990, 38(6): 875-888.
9. I. Vajda and G. Einarsson. “Code acquisition for a frequency-hopping system,” IEEE Trans. Commun., 1987, 35(5): 566-568.
10. R. Gagliardi, J. Robbins and H. Taylor. “Acquisition sequence in PPM communications,” IEEE Trans, on Inform. Theory, 1987, 33(5): 738-744.
11. R. Blahut. Theory and Practice of Error Control Codes, Addison-Wesley, 1987.
12. D.M. Burton. Elementary Number theory, Boston, MA: Allyn and Bacon Inc., 1980.
13. Z.X. Wan. Algebra and Coding (in Chinese), Beijing: Science Press, 1984.
14. S. Roman. Coding and Information Theory, Berlin: Springer-Verlag, 1992.
15. H.F. Mattson and G. Solomon. “A new treatment of Bose-Chaudhuri codes,” J. SIAM, 1961, vol.9, pp. 654-669. reprinted in Key Papers in the Development of Coding Theory, E. R. Berlekamp, ed., 82-86, New York: IEEE Press, 1974.
16. F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-Correcting Codes, New York: North-Holland, 1977.
17. B. Elspas. “The Theory of Autonomous Linear Sequential Networks,” IRE Transactions on Circuit Theory, vol. CT-6, pp. 45-60, March 1959. reprinted in Linear Sequential Switching Circuits: Selected Technical Papers, W. Kautz, ed., 21-61, San Francisco, Holden-Day, 1965.