On the Covering Radius of Small Codes Versus Dual Distance
From MaRDI portal
Publication:4611427
DOI10.1109/TIT.2018.2857495zbMath1431.94139arXiv1707.06628OpenAlexW2963978969WikidataQ129509432 ScholiaQ129509432MaRDI QIDQ4611427
Publication date: 18 January 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.06628
Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
This page was built for publication: On the Covering Radius of Small Codes Versus Dual Distance