New results on codes with covering radius 1 and minimum distance 2
DOI10.1007/S10623-005-6404-3zbMATH Open1081.94041OpenAlexW1990642595MaRDI QIDQ1781002FDOQ1781002
Patric R. J. Östergård, Alfred Wassermann, Jörn Quistorff
Publication date: 15 June 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-6404-3
Recommendations
- On codes with covering radius 1 and minimum distance 2
- On codes with given minimum distance and covering radius
- scientific article; zbMATH DE number 1505644
- A new approach to the covering radius of codes
- Several new lower bounds on the size of codes with covering radius one
- On mixed codes with covering radius 1 and minimum distance 2
- On mixed codes with covering radius 1 and minimum distance 2
- Further results on the covering radius of codes
- scientific article; zbMATH DE number 729918
- New bounds for linear codes of covering radius 2
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cites Work
- Intersection Inequalities for the Covering Problem
- Isomorph-Free Exhaustive Generation
- Attacking the market split problem with lattice point enumeration
- 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
- The football pool problem for 5 matches
- Bounds on mixed binary/ternary codes
- Classification of binary covering codes
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
- A Combinatorial Problem in Matching
- Covering problems for dichotomized matchings
Cited In (8)
- Search for combinatorial objects using lattice algorithms -- revisited
- Graphs associated with codes of covering radius 1 and minimum distance 2
- Further results on the covering radius of small codes
- On mixed codes with covering radius 1 and minimum distance 2
- Codes that attain minimum distance in every possible direction
- On codes with covering radius 1 and minimum distance 2
- Jack van Lint (1932--2004): a survey of his scientific work
- On maximal partial Latin hypercubes
Uses Software
This page was built for publication: New results on codes with covering radius 1 and minimum distance \(2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781002)
