A theorem on equidistant codes

From MaRDI portal





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.











This page was built for publication: A theorem on equidistant codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758951)