On upper bounds for minimum distance and covering radius of non-binary codes

DOI10.1023/A:1008260505585zbMath0899.94028OpenAlexW1911679041MaRDI QIDQ1379663

Tero Laihonen, Simon N. Litsyn

Publication date: 17 November 1998

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008260505585

zbMATH Keywords

upper boundscovering radiusminimum distanceasymptotic information rate

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (1)

On bounds for codes over Frobenius rings under homogeneous weights

This page was built for publication: On upper bounds for minimum distance and covering radius of non-binary codes