
arXiv: 1802.01073
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.
9 pages
FOS: Computer and information sciences, weighted Hamming metric, Computer Science - Information Theory, Information Theory (cs.IT), perfect code, 94B05, weight distribution, Hamming code, extended Hamming code, Linear codes (general theory)
FOS: Computer and information sciences, weighted Hamming metric, Computer Science - Information Theory, Information Theory (cs.IT), perfect code, 94B05, weight distribution, Hamming code, extended Hamming code, Linear codes (general theory)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
