Quasi-Perfect Codes With Small Distance

DOI10.1109/TIT.2005.856944zbMath1298.94149MaRDI QIDQ3546852

Beniamin Mounits, Tuvi Etzion

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

coveringdensitypackingquasi-perfect codesBlockwise direct sum (BDS) construction

Mathematics Subject Classification ID

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)

Related Items (5)

Quasi-perfect linear codes from planar and APN functions ⋮ On the covering radius of some binary cyclic codes ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ A family of constacyclic ternary quasi-perfect codes with covering radius 3 ⋮ A family of ternary quasi-perfect BCH codes

This page was built for publication: Quasi-Perfect Codes With Small Distance