Quaternary Quadratic Residue Codes and Unimodular Lattices

IEEE Transactions on Information Theory

Volumn 41, Issue 2, 1995, Pages 366-377

  Bonnecaze, Alexis ^a   Solé, Patrick ^a   Calderbank, A R ^b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Codes over rings; even unimodular lattices; Leech lattic; quadratic residue codes; self dual codes

Indexed keywords

CODING ERRORS; DATA COMMUNICATION SYSTEMS; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; ERROR DETECTION; FOURIER TRANSFORMS; LINEAR ALGEBRA; POLYNOMIALS; VECTORS;

AUTOMORPHISM GROUP; BINARY IMAGES; CODES OVER RINGS; EVEN UNIMODULAR LATTICES; GRAY MAP; HENSEL LIFTING; IDEMPOTENTS; LEECH LATTICES; QUADRATIC RESIDUE CODES; SELF DUAL CODES;

BINARY CODES;

EID: 0029272035     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.370138     Document Type: Article

References (35)

1. O. Amrani, Y. Be'ery, A. Vardy, F.-W. Sun, and H. C. A. van Tilborg, “The Leech lattice and the Golay code: Bounded-distance decoding and multilevel constructions,” IEEE Trans. Inform. Theory, vol. 40, pp. 1030–1043, July 1994.
2. E. F. Assmus, Jr., and H. F. Mattson, Jr., “New 5-designs,” J. Comb. Theory, vol. 6, pp. 122–151, 1969.
3. G. F. M. Beenker, “On double circulant codes,” Rep. 80-WSK-04, Dep. Math., Technol. Univ. Eindhoven, Eindhoven, The Netherlands, July 1980.
4. T. Beth, D. Jungnickel, and H. Lenz, Design Theory. Mannheim, Germany: Bibl. Tnstitut-Wissenschaftsverlag, 1985.
5. R. E. Blahut, “The Gleason—Prange theorem,” IEEE Trans. Inform. Theory, vol. 37, pp. 1269–1273, Sept. 1991.
6. A. Bonnecaze and P. Solé, “Quaternary constructions of formally self-dual binary codes and unimodular lattices,” in Proc. 1st Franco—Israeli Workshop on Coding Theory. (Paris, July 1993), Springer Lecture Notes in Computer Science 781 Berlin, Germany: Springer-Verlag, 1994, pp. 194–206.
7. A. E. Brouwer and L. M. G. M. Tollhuizen, “A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with the preparata properties,” Des. Codes and Cryptogr., vol. 3, pp. 95–98, 1993.
8. A. R. Calderbank, “Topics in algebraic coding theory,” Ph.D. dissertation, Calif. Inst. Technol., 1980.
9. —, “A square root bound on the minimum weight in quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 332–337, May 1983.
10. A. R. Calderbank and N. J. A. Sloane, “Modular and p-adic cyclic codes,” preprint, Dec. 1993.
11. A. R. Calderbank and D. B. Wales, “Multiplying vectors in binary quadratic residue codes,” SIAM J. Alg. Disc. Methods, vol. 3, pp. 43–55, Mar, 1982.
12. —, “A global code invariant under the Higman-Sims group,” J. Algebra, vol. 75, pp. 233–260, 1982.
13. P. Camion, “Global quadratic Abelian codes,” in Information Theory (C.I.S.M. Courses and Lectures, 219). G. Longo, Ed. Vienna, Austria: Springer, 1975.
14. J. H. Conway and N. J. A. Sloane, “Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41–50, Jan. 1986.
15. —, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
16. —, “Self-dual codes over the integers modulo 4,” J. Comb. Theory (A), vol. 62, pp. 30–45, Jan. 1993.
17. G. D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
18. M. P. Hale, Jr., and E. E. Shult, “Equiangular lines, the graph extension theorem, and transfer in triply transitive groups,” Math. Z., vol. 86, pp. 145–156, 1964.
19. A. R. Hammons, Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé, “The Z4-linearity of Kerdock, Preparata, Goethals and related codes,” IEEE Trans. Inform. Theory, vol. 40, pp. 301–319, Mar. 1994.
20. W. Heise and P. Quattrochi, Informations und Codingstheorie. Berlin, Germany: Springer-Verlag, 1989.
21. G. T. Kennedy and V. Pless, “Ondesigns and formally self-dual codes,” preprint, 1992.
22. M. Klemm, “Selbstduale Codes über dem Ring der ganzen Zahlen modulo 4,” Arch. Math., vol. 53, pp. 201–207, 1989.
23. G. R. Lang, and F. M. Longstaff, “A Leech lattice modem,” IEEE J. Selected Areas Commun., vol. 7, pp. 968–973, 1989.
24. J. S. Leon, J. M. Masley, and V. Pless, “Duadic codes,” EEE Trans. Inform. Theory, vol. IT-30, pt. I, pp. 709–714, Sept. 1984.
25. J. H. van Lint, Introduction to Coding Theory. Berlin, Germany: Springer-Verlag, 1982.
26. J. H. van Lint and F. J. MacWilliams, “Generalized quadratic residue codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 730–737, Nov. 1978.
27. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1978.
28. V. Pless, “A classification of self-orthogonal codes over GF(2),” Discrete Math., vol. 3, pp. 209–246, 1972.
29. —, The Theory of Error-Correcting Codes. New York: Wiley-Interscience, 1989.
30. M. Plotkin, “Binary codes with specified minimum distances,” IEEE Trans. Inform. Theory, vol. IT-6, pp. 445–450, 1960.
31. P. Solé, “Generalized theta functions for lattice vector quantization,” in Coding and Quantization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 14. Providence, RH: American Math. Soc., 1993, pp. 27–32.
32. N. J. A. Sloane and D. S. Whitehead, “A new family of single error-correcting codes,” IEEE Trans. Inform. Theory, vol. TT-16, pp. 717–719, 1970.
33. D. E. Taylor, “Regular 2-graphs,” Proc. London Math. Soc. Ser. 3, vol. 35, pp. 257–274, 1977.
34. N. M. Vetchinkin, “Uniqueness of the classes of positive quadratic forms on which the values of Hermite constants arc attained for 6 ≤ n ≤ 8,” Proc. Steklov Inst. Math., no. 3, pp. 37–95, 1982.
35. H. N. Ward, “Quadratic residue codes and symplectic groups,” J. Algebra, vol. 29, pp. 150–171, 1974.