Covering radius 1985-1994
DOI10.1007/S002000050061zbMATH Open0873.94025OpenAlexW2073623937MaRDI QIDQ676007FDOQ676007
Authors: H. F. jun. Mattson, Gérard Cohen, Simon Litsyn, Antoine Lobstein 
Publication date: 20 October 1997
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000050061
Recommendations
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cited In (28)
- Further results on the covering radius of codes
- New upper bounds for binary covering codes
- The covering radii of a class of binary cyclic codes and some BCH codes
- Covering radius---Survey and recent results
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Explicit codes with low covering radius
- Lower bound of the covering radius of irreducible Goppa codes
- On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric
- On the covering radius of codes
- New quaternary linear codes with covering radius 2
- On the covering of vertices for fault diagnosis in hypercubes
- A Brief Survey of Covering Radius
- An improved lower bound on the covering number \(K_2(9,1)\)
- On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right]\) shortened Hamming codes and their dual-codes
- Resolution of a conjecture on the covering radius of linear codes
- Covering codes with improved density
- Asymptotic bounds on the covering radius of binary codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A rational periodicity theorem for division codes
- On covering radius of a family of codes \({\mathcal C}_m\cup(1+{\mathcal C}_m)\) with maximum distance between \({\mathcal C}_m\) and \(1+{\mathcal C}_m\)
- On interval colouring reorientation number of oriented graphs
- Asymmetric binary covering codes.
- Title not available (Why is that?)
- Lower bound of covering radius of binary irreducible Goppa codes
- On the covering radii of a class of binary primitive cyclic codes
- Title not available (Why is that?)
- A new lower bound for the football pool problem for 7 matches
This page was built for publication: Covering radius 1985-1994
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676007)
