On perfect codes that do not contain Preparata-like codes

DOI10.1134/S0032946016030066zbMATH Open1369.94607arXiv1512.03048OpenAlexW2970120390MaRDI QIDQ2364474FDOQ2364474

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

Publication date: 21 July 2017

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

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.

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

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

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

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)