Packing radius, covering radius, and dual distance

DOI10.1109/18.370102zbMath0830.94022OpenAlexW2170132643MaRDI QIDQ4840890

Patrick Solé

Publication date: 4 February 1996

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

Full work available at URL: https://doi.org/10.1109/18.370102

zbMATH Keywords

upper boundscovering radiusminimum distanceself-dual binary codes\(q\)-ary unrestricted code

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 (2)

On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ The covering radius of permutation designs

This page was built for publication: Packing radius, covering radius, and dual distance