scientific article; zbMATH DE number 16389

From MaRDI portal
Publication:3973043





[For the entire collection see Zbl 0721.00028.] This paper gives basic concepts in coding needed to explain how certain binary codes are lexicodes. Lexicodes are described by \textit{J. H. Conway} and \textit{N. J. A. Sloane} [IEEE Trans. Inf. Theory IT-32, 337-348 (1986; Zbl 0594.94023)] as codes whose codewords are the winning positions in particular combinatorial games. Explicit examples of this connection are given for coin turning games and Hamming codes, and some quadratic residue codes. Open problems and relations to combinatorial designs are given.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973043)