scientific article; zbMATH DE number 3557661
Let \(x\) be any word of length \(n\) and Hamming-weight \(k\) over an alphabet of \(q\) symbols. The number of words \(y\) of weight \(i\) and at distance \(j\) from \(x\) does not depend on \(x\). We denote this number by \(p_{ij}^{(k)}\). Let \(C\) be an e-Hamming-error-correcting code and \(x\in C\). For each \(k\), \(0\le k\le n\) we define \(\alpha_k\) to be the number of codewords \(y\in C\) at distance \(k\) from \(x\). A necessary condition for the existence of a perfect e-Hamming-error-correcting code is that the system of linear equations \[ \sum_{k=0}^n \sum_{j=0}^n p_{ij}^{(k)} \alpha_k = (q-1)^i\binom{n}{i} \qquad (i=0,1,\ldots,n) \tag{1} \] has a (non-negative) integral solution satisfying \[ \alpha_1 = \ldots = \alpha_n = 0. \tag{2} \] The system (1) has a solution satisfying (2) iff the Lloyd-polynomial of degree \(e\) has distinct integral zeros in the set \(1,2,\ldots,n\). Moreover, if this is the case, this solution is unique, but not necessarily integral. So this new condition is somewhat sharper than Lloyd's theorem. The proof is based on calculation of the weight enumerator by counting arguments. The basic idea of this condition was already explored by Zaremba.
- The non-existence of some perfect codes over non-prime power alphabets
- Homogeneity theorems on perfect codes in Hamming schemes and generalized Hamming schemes
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
- On a Diophantine Equation Related to Perfect Codes
- On perfect constant weight codes
- Homogeneity theorems on perfect codes in Hamming schemes and generalized Hamming schemes
- Necessary and sufficient conditions of commutatively prefix codes and every-layer-extensible codes
- The non-existence of some perfect codes over non-prime power alphabets
- On the non-existence fo perfect double Hamming-error-correcting codes on \(q=11\) symbols
- On a Diophantine Equation Related to Perfect Codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133528)