Bounds for covering codes over large alphabets
From MaRDI portal
Publication:2572977
DOI10.1007/s10623-004-3804-8zbMath1158.94424MaRDI QIDQ2572977
Patric R. J. Östergård, Gerzson Kéri
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-3804-8
94B65: Bounds on codes
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
94B25: Combinatorial codes
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Covering and radius-covering arrays: constructions and classification, Lower bounds on covering codes via partition matrices
Cites Work
- A Graham-Sloane type construction for \(s\)-surjective matrices
- More coverings by rook domains
- Constructing strength three covering arrays with augmented annealing
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- A new table of binary/ternary mixed covering codes
- New upper bounds for binary covering codes
- Lower bounds for \(q\)-ary codes of covering radius one
- On saturating sets in small projective geometries
- A new lower bound for the football pool problem for six matches
- On the state of strength-three covering arrays
- Lower bounds for q-ary covering codes
- Group construction of covering arrays
- An updated table of binary/ternary mixed covering codes
- A note on bounds for q-ary covering codes
- A Combinatorial Problem in Matching
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- Coverings by rook domains
- Rook domains, Latin squares, affine planes, and error-distributing codes
- Modified bounds for covering codes
