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)

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

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)