Constructions for perfect mixed codes and other covering codes

DOI10.1109/18.179360zbMath0765.94019OpenAlexW2151987797MaRDI QIDQ4034453

Gadi Greenberg, Tuvi Etzion

Publication date: 16 May 1993

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

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

zbMATH Keywords

covering radiusHamming codequasi-perfect codePreparata codenormal casecombining codesbinary covering codesperfect mixed codes

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Related Items (4)

On the covering radius of some binary cyclic codes ⋮ Small complete caps in Galois affine spaces ⋮ New upper bounds for binary covering codes ⋮ Hamming and simplex codes for the sum-rank metric

This page was built for publication: Constructions for perfect mixed codes and other covering codes