Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions

DOI10.1109/TIT.2008.928277zbMath1327.94087arXiv0712.1465OpenAlexW2156190920MaRDI QIDQ3604821

Iliya G. Bouyukliev, Veerle Fack, Stefan Dodunekov, Tsonka Stefanova Baicheva

Publication date: 24 February 2009

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

Full work available at URL: https://arxiv.org/abs/0712.1465

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ A family of constacyclic ternary quasi-perfect codes with covering radius 3

This page was built for publication: Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions