Lexicographic codes: Error-correcting codes from game theory
From MaRDI portal
Recommendations
Cited in
(28)- Some lower bounds for constant weight codes
- New bounds for perfect hashing via information theory
- On \((p,1)\)-subnormal \(q\)-ary covering codes
- The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games
- Symmetry properties of resolving sets and metric bases in hypercubes
- Lexicodes over finite principal ideal rings
- Complexity, appeal and challenges of combinatorial games
- A recursive definition of \(p\)-ary addition without carry
- Combinatorial game distributions of Steiner systems
- Naive configurations
- Lexicodes over rings
- Winning ways of weighted poset games
- The lex game and some applications
- Bounds on codes derived by counting components in Varshamov graphs
- On the construction of linear \(q\)-ary lexicodes.
- scientific article; zbMATH DE number 988847 (Why is no real title available?)
- Minimal distance lexicographic codes over an infinite alphabet
- Integral lexicographic codes
- A decoding scheme for the 4-ary lexicodes with d_m=4.
- scientific article; zbMATH DE number 16389 (Why is no real title available?)
- Anti-codes in terms of Berlekamp's switching game
- scientific article; zbMATH DE number 1894904 (Why is no real title available?)
- Preface
- Sport lotteries and codes
- Block‐avoiding point sequencings
- Greedy codes
- On the clique covering numbers of Johnson graphs
- Integral lexicographic codes
This page was built for publication: Lexicographic codes: Error-correcting codes from game theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3726012)
