On perfect codes that do not contain Preparata-like codes

DOI10.1134/S0032946016030066MaRDI QIDQ2364474zbMATH OpenOpenAlexFDO

Authors Denis S. Krotov, A. Yu. Vasil'eva

Publication date 21 July 2017

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.03048

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Abstract: We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.

Cites work

• A class of optimum nonlinear double-error-correcting codes
• A survey of perfect codes
• scientific article; zbMATH DE number 3178047 (Why is no real title available?)
• scientific article; zbMATH DE number 3700716 (Why is no real title available?)
• scientific article; zbMATH DE number 3480474 (Why is no real title available?)
• scientific article; zbMATH DE number 3601524 (Why is no real title available?)
• scientific article; zbMATH DE number 3321827 (Why is no real title available?)
• scientific article; zbMATH DE number 4187720 (Why is no real title available?)
• On components of preparata codes
• On perfect binary codes
• On the Preparata and Goethals codes
• Symplectic semifield planes and ℤ₄–linear codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Uniformly packed codes and more distance regular graphs from crooked functions

Cited in

(1)

• A testing set for Preparata-like codes

This page was built for publication: On perfect codes that do not contain Preparata-like codes

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