Lexicographic codes: Error-correcting codes from game theory
From MaRDI portal
Publication:3726012
DOI10.1109/TIT.1986.1057187zbMath0594.94023MaRDI QIDQ3726012
Conway, John H., N. J. A. Sloane
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Steiner systemsgreedy algorithmHamming codesimpartial gameslexicodesbinary Golay codesrecord-breaking constant weight codes
Related Items
Combinatorial game distributions of Steiner systems, On \((p,1)\)-subnormal \(q\)-ary covering codes, Complexity, appeal and challenges of combinatorial games, Winning ways of weighted poset games, The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games, Some lower bounds for constant weight codes, New bounds for perfect hashing via information theory, Symmetry properties of resolving sets and metric bases in hypercubes, Block‐avoiding point sequencings, A recursive definition of \(p\)-ary addition without carry, Preface, Naive configurations, Lexicodes over rings, Greedy codes, Bounds on codes derived by counting components in Varshamov graphs, Lexicodes over finite principal ideal rings, Integral lexicographic codes, On the construction of linear \(q\)-ary lexicodes.
