An updated table of binary/ternary mixed covering codes
From MaRDI portal
Publication:4736760
DOI10.1002/JCD.20008zbMATH Open1054.94022OpenAlexW1963788317MaRDI QIDQ4736760FDOQ4736760
Riccardo Bertolo, William D. Weakley, Patric R. J. Östergård
Publication date: 6 August 2004
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20008
Recommendations
- A new table of binary/ternary mixed covering codes
- Mixed binary/ternary covering codes
- Some new lower bounds for binary and ternary covering codes
- Some new lower bounds for ternary covering codes
- Generalized bounds and binary/ternary mixed packing and covering codes
- scientific article; zbMATH DE number 1057755
- Ternary covering codes derived from BCH codes
- New upper bounds for binary covering codes
- Ternary Hamming and binary perfect covering codes
- Constructions, families, and tables of binary linear covering codes
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Title not available (Why is that?)
- A new table of binary/ternary mixed covering codes
- Upper bounds for football pool problems and mixed covering codes
- A new lower bound for the football pool problem for six matches
- On the size of optimal binary codes of length 9 and covering radius 1
- Title not available (Why is that?)
- On the covering radius of small codes
- Constructing covering codes with given automorphisms
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- Generalized bounds and binary/ternary mixed packing and covering codes
- New lower bounds for covering codes
- Lower bounds for \(q\)-ary codes of covering radius one
- Further results on (k, t)-subnormal covering codes
- An improved upper bound for the football pool problem for nine matches
- A new binary code of length 10 and covering radius 1
- Ternary covering codes derived from BCH codes
- Classification of binary/ternary one-error-correcting codes
- Several new lower bounds on the size of codes with covering radius one
Cited In (12)
- Further results on the covering radius of small codes
- On mixed codes with covering radius 1 and minimum distance 2
- On mixed codes with covering radius 1 and minimum distance 2
- Bounds for covering codes over large alphabets
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
- Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
- The domination complexity and related extremal values of large 3D torus
- Title not available (Why is that?)
- Title not available (Why is that?)
- (Total) domination in prisms
- Title not available (Why is that?)
- On the covering radius of small codes
Uses Software
This page was built for publication: An updated table of binary/ternary mixed covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736760)
