Switching equivalence classes of perfect codes

DOI10.1023/A:1017150214026MaRDI QIDQ1299914zbMATH OpenOpenAlexFDO

Authors Kevin T. Phelps, Mike LeVan

Publication date 22 November 1999

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1017150214026

zbMATH Keywords

Hamming codesperfect codesswitching equivalence

Mathematics Subject Classification ID

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

Review text

A binary 1-error correcting perfect code is called switching equivalent to the Hamming code (of the same parameters) if there is a sequence of switches (replacing a specially selected set of codewords for another set of words) which leads to the Hamming code. \textit{S. V. Avgustinovich} and \textit{F. I. Solov'eva} [Construction of perfect binary codes by the sequential translations of the \(i\)-components, Proc. Fifth Intern. Workshop ACCT, Sozopol, Bulgaria, 9-14 (1996; Zbl 0923.94035)] developed this approach and conjectured that every binary 1-error correcting perfect code is switching equivalent to a Hamming code. In the paper under review, the authors disprove this by construction of a perfect code of length 15 which can not be obtained from the Hamming code by switching.

Recommendations

• scientific article; zbMATH DE number 1420999
• The classification of some perfect codes
• Construction of perfect \(q\)-ary codes by switchings of simple components
• Perfect codes and related structures
• Switching of covering codes
• Equivalence classes and structures of constacyclic codes over finite fields
• \(e\)-perfect codes
• On the classification of perfect codes: side class structures
• scientific article; zbMATH DE number 2235061
• On the classification of perfect codes: extended side class structures

Cited in

(12)

• Switching of covering codes
• On existence of perfect bitrades in Hamming graphs
• On non-full-rank perfect codes over finite fields
• Construction of perfect \(q\)-ary codes by switchings of simple components
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• On the minimum distance graph of an extended Preparata code
• On enumeration of the perfect binary codes of length 15
• scientific article; zbMATH DE number 1420999 (Why is no real title available?)
• On perfect binary codes
• Switching codes and designs
• On switching equivalence of \(n\)-ary quasigroups of order 4 and perfect binary codes
• On the classification of perfect codes: side class structures

This page was built for publication: Switching equivalence classes of perfect codes

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