Weighted Hamming metric structures
From MaRDI portal
Abstract: A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the extended binary Hamming code to be perfect codes in the weighted Hamming metric. And, we also give some structures of a 2-perfect code and how to construct a 2-perfect code in some weighted Hamming metric.
Recommendations
- Class of generalized Goppa codes perfect in weighted Hamming metric
- Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code
- Weighted perfect codes in Lee metric
- The poset structures admitting the extended binary Hamming code to be a perfect code
- On the generalized Hamming weights of geometric Goppa codes
Cites work
- Class of generalized Goppa codes perfect in weighted Hamming metric
- Generalized MacWilliams identities and their applications to perfect binary codes
- On perfect Lee codes
- On the reconstruction of perfect codes
- The diophantine equation x^2+7=2ⁿ
- The poset structures admitting the extended binary Hamming code to be a perfect code
Cited in
(3)
This page was built for publication: Weighted Hamming metric structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783635)