Lexicographic Codes: Error-Correcting Codes from Game Theory

IEEE Transactions on Information Theory

Volumn 32, Issue 3, 1986, Pages 337-348

  Conway, John H ^a   Sloane, N J A ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY - GAME THEORY;

GREEDY ALGORITHM; IMPARTIAL GAMES; LEXICOGRAPHIC CODES; RECORD-BREAKING CONSTANT WEIGHT CODES;

CODES, SYMBOLIC;

EID: 0022717929     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1986.1057187     Document Type: Article

References (22)

1. E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways, 2 vols. New York: Academic, 1982.
2. J. H. Conway, On Numbers and Games. New York: Academic, 1976.
3. J. H. Conway and H. S. M. Coxeter, “Triangulated polygons and frieze patterns,” Math. Gazette, vol. 57 pp. 87–94, 175–183, 1973.
4. J. H. Conway, V. Pless, and N. J. A. Sloane, “Self-dual codes over GF(3) and GF(4) of length not exceeding 16,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 312–322, 1979.
5. J. H. Conway and N. J. A. Sloane, “Laminated lattices,” Ann. Math., vol. 116, pp. 593–620, 1982.
6. J. H. Conway and N. J. A. Sloane, “Complex and integral laminated latices,” Trans. Amer. Math. Soc., vol. 280, pp. 463–490, 1983.
7. J. H. Conway and N. J. A. Sloane, The Leech Lattice, Sphere Packings, and Related Topics. New York: Springer-Verlag, 1986, to appear.
8. R. L. Graham and N. J. A. Sloane, “Lower bounds for constant weight codes,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 37–43, 1980.
9. P. M. Grundy, “Mathematics and games,” Eureka, vol. 2, pp. 6–8, 1939; reprinted in vol. 27, pp. 9–11, 1964.
10. M. J. T. Guy, unpublished.
11. R. K. Guy and C. A. B. Smith, “The G-values for various games,” Proc. Camb. Math. Soc., vol. 52, pp. 514–526, 1956.
12. A. A. Hashim and A. G. Constantinides, “Some new results on binary linear block codes,” Electron. Lett., vol. 10, pp. 31–33, 1974.
13. D. Julin, “Two improved block codes,” IEEE Trans. Inform. Theory, vol. IT-11, p. 459, 1965.
14. H. W. Lenstra, Jr., On the algebraic closure of two,” Konink. Nederl. Akad. Wetensch. Proc., vol. A80, pp. 389–396, 1977.
15. H. W. Lenstra, Jr., “Nim multiplication,” in Seminaire de Theorie des Nombres 1977–1978, Centre National de Recherche Scientifique, Talence, France, Exp. 11, 1978.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam, The Netherlands: North Holland, 1977.
17. P. Piret, “Good block codes derived from cyclic codes,” Electron. Lett., vol. 10. pp. 391–392, 1974.
18. A. J. E. Ryba, personal communication.
19. R. P. Sprague, “Uber mathematische Kampfspiele,” Tôhoku Math. J., vol. 41, pp. 438–444, 1935–1936.
20. C. P. Welter, “The advancing operation in a special abelian group,” Koninkl. Nederl. Akad. Weten. Proc., vol. A55, pp. 304–314, 1952.
21. C. P. Welter, “The theory of a class of games on a sequence of squares, in terms of the advancing operation in a special group,” Koninkl. Nederl. Akad. Weten. Proc., vol. A57, pp. 194–200, 1954.
22. R. A. Wilson, “On lexicographic codes of minimal distance 4,” Atti Sem. Mat. Fis. Univ. Modena, to appear.