On nonsystematic perfect binary codes of length 15

DOI10.1016/S0166-218X(02)00309-8MaRDI QIDQ4947390zbMATH OpenOpenAlexFDO

Authors A. M. Romanov

Publication date 16 April 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(02)00309-8

zbMATH Keywords

nonsystematic code perfect binary code

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other types of codes (94B60)

Review text

A perfect code \(C\) of length \(n\) is systematic if there are \(n-\log(n+1)\) coordinates such that the code \(C\) deleted in the remaining \(\log(n+1)\) coordinates coincides with \(E^{n-\log(n+1)}\). Two nonequivalent nonsystematic perfect binary codes of length 15 are constructed using a switching approach. Earlier, \textit{S. V. Avgustinovich} and \textit{F. I. Solov'eva} [Probl. Inf. Transm. 32, No. 3, 258-261 (1996); see also Zbl 0923.94035] constructed a class of nonsystematic perfect binary codes of length \(n = 2^k - 1\), \(k > 7\), by using a switching approach. \textit{K. Phelps} and \textit{M. LeVan} presented such perfect codes for \(5 \leq k \leq 7\) by using a switching approach too [SIAM J. Discrete Math. 12, No. 1, 27-34 (1999)]. The question is still unanswered whether the nonsystematic perfect codes of length 15 given by K. Phelps and M. LeVan are equivalent to codes given by A. M. Romanov.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: On nonsystematic perfect binary codes of length 15

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