No label defined (Q3973043)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 16389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 16389 |
Statements
26 June 1992
0 references
error-correcting codes
0 references
lexicodes
0 references
combinatorial games
0 references
coin turning games
0 references
Hamming codes
0 references
quadratic residue codes
0 references
0.8547567129135132
0 references
0.8000428080558777
0 references
[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.
0 references
