On perfect codes that do not contain Preparata-like codes

DOI10.1134/S0032946016030066zbMath1369.94607arXiv1512.03048OpenAlexW2970120390MaRDI QIDQ2364474

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)

Cites Work

• Uniformly packed codes and more distance regular graphs from crooked functions
• On components of preparata codes
• On the Preparata and Goethals codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Symplectic semifield planes and ℤ₄–linear codes
• A class of optimum nonlinear double-error-correcting codes
• A survey of perfect codes
• On perfect binary codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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