On the covering radius of Z/sub 4/-codes and their lattices

DOI10.1109/18.782168zbMath0959.94036OpenAlexW2160500982MaRDI QIDQ4503397

Masaaki Harada, Toru Aoki, Michio Ozeki, Patrick Solé, Philippe Gaborit

Publication date: 7 September 2000

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

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

zbMATH Keywords

covering radiusupper and lower boundslower boundsDelsarte boundLee distanceNiemeier latticescodes over \(\mathbb{Z}_4\)redundancy boundsKlemm codesLee and Euclidean distancespacking radius boundself-dual codes over \(\mathbb{Z}_4\)

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) Relations with coding theory (11H71)

Related Items (12)

On the ℤ_q-Simplex codes and its weight distribution for dimension 2 ⋮ On ℤ_q-linear and ℤ_q-Simplex codes and its related parameters forqis a prime power ⋮ Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) ⋮ Simplex and MacDonald codes over \(R_q\) ⋮ On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance ⋮ An algorithm for maximising covered area ⋮ On the covering radius of some modular codes ⋮ On codes over ℤp2 and its covering radius ⋮ On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii ⋮ Lexicodes over rings ⋮ On covering radius of codes over ℤ2p ⋮ Covering aspects of the Niemeier lattices

This page was built for publication: On the covering radius of Z/sub 4/-codes and their lattices