No label defined (Q4133528)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3557661
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3557661

      Statements

      0 references
      0 references
      1977
      0 references
      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.
      0 references

      Identifiers