A theorem on equidistant codes (Q758951)

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 3427199
Language Label Description Also known as
default for all languages
No label defined
    English
    A theorem on equidistant codes
    scientific article; zbMATH DE number 3427199

      Statements

      A theorem on equidistant codes (English)
      0 references
      0 references
      1973
      0 references
      A binary code with length \( {n} \) is called equidistant with distance \( 2 {k} \) if every pair of distinct code words has Hamming distance \( 2 {k} \). Call such a code an \( (m, 2 k, n) \) code. Let \( C \) be the \( (0,1) \) matrix which has as its rows all the code words of an \( (m, 2 k, n) \) code. If every column of \( C \) has \( m \) or \( m-1 \) equal entries then the code is called trivial. In [\textit{M. Deza}, [Discrete Math. 6, 343--352 (1973; Zbl 0271.94006)], it is proved that if \( m>k^{2}+k+2 \) then the code must be trivial. In this paper it is shown that a nontrivial \( \left(k^{2}+k+2,2 k, n\right. \) ) code exists (for sufficiently large \( n \) ) if and only if a projective plane of order \( k \) exists.
      0 references
      0 references

      Identifiers