Description
An \((n,K,2t+1)_q\) code is uniformly packed if its external distance is equal to \(t+1\) [4]; see [5; Def. 2.5] for the case of even distance and other generalizations.
Parent
- Completely regular code — Uniformly packed codes are completely regular [3][5; Prop. 2.6].
Child
- Quasi-perfect code — Quasi-perfect codes are uniformly packed [5; Def. 2.5].
Cousin
- Dodecacode — The punctured dodecacode code is uniformly packed [6].
References
- [1]
- N. V. Semakov, V. A. Zinov'ev, G. V. Zaitsev, “Uniformly Packed Codes”, Probl. Peredachi Inf., 7:1 (1971), 38–50; Problems Inform. Transmission, 7:1 (1971), 30–39
- [2]
- H. C. A. van Tilborg. Uniformly packed codes. Technische Hogeschool Eindhoven, 1976.
- [3]
- J. M. Goethals and H. C. A. Van Tilborg. “Uniformly packed codes”. In Philips Research Reports 30.1 (1975)
- [4]
- F. J. MacWilliams and N. J. A. Sloane. The theory of error correcting codes. Elsevier, 1977.
- [5]
- J. Borges, J. Rifà, and V. A. Zinoviev, “On Completely Regular Codes”, (2017) arXiv:1703.08684
- [6]
- D. Krotov and P. Sole, “The punctured Dodecacode is uniformly packed”, 2019 IEEE International Symposium on Information Theory (ISIT) (2019) DOI
Page edit log
- Victor V. Albert (2024-08-16) — most recent
Cite as:
“Uniformly packed code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/uniformly_packed