Covering radius 1985-1994
From MaRDI portal
Publication:676007
DOI10.1007/S002000050061zbMath0873.94025OpenAlexW2073623937MaRDI QIDQ676007
H. F. jun. Mattson, Gérard D. Cohen, Antoine C. Lobstein, Simon N. Litsyn
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
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)
Related Items (11)
On the covering of vertices for fault diagnosis in hypercubes ⋮ On the covering radii of a class of binary primitive cyclic codes ⋮ New upper bounds for binary covering codes ⋮ Covering Radius of Matrix Codes Endowed with the Rank Metric ⋮ On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric ⋮ The covering radii of a class of binary cyclic codes and some BCH codes ⋮ Lower bound of the covering radius of irreducible Goppa codes ⋮ A new lower bound for the football pool problem for 7 matches ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ 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] ⋮ An improved lower bound on the covering number \(K_2(9,1)\)
This page was built for publication: Covering radius 1985-1994
