On perfect p-ary codes of length p+1

DOI10.1007/S10623-007-9133-YMaRDI QIDQ1008963zbMATHOpenAlexFDO

Authors Olof Heden

Publication date 31 March 2009

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

Full work available at URL https://doi.org/10.1007/s10623-007-9133-y

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 6516526
• On perfect arithmetic codes
• Perfect binary codes: constructions, properties, and enumeration
• A note on perfect arithmetic codes (Corresp.)
• A characterization of 1-perfect additive codes
• On a property of perfect binary codes
• scientific article; zbMATH DE number 850320
• A Combinatorial Construction of Perfect Codes
• On a class of perfect codes with maximum components
• Perfect codes in the \(\ell_p\) metric

Cites work

• scientific article; zbMATH DE number 3501652 (Why is no real title available?)
• scientific article; zbMATH DE number 3222940 (Why is no real title available?)
• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• A General Product Construction for Error Correcting Codes
• A full rank perfect code of length 31
• A generalized Lloyd theorem and mixed perfect codes.
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• More coverings by rook domains
• Nonequivalent q-Ary Perfect Codes
• On Group and Nongroup Perfect Codes in $q$ Symbols.
• On linear and nonlinear single-error-correcting q-nary perfect codes
• Perfect codes from the dual point of view. I
• Perfect codes hardly exist
• Ranks of \(q\)-ary 1-perfect codes

Cited in

(15)

• scientific article; zbMATH DE number 6516526 (Why is no real title available?)
• On the classification of perfect codes: extended side class structures
• Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
• Shortening Array Codes and the Perfect $1$-Factorization Conjecture
• Comments on "A note on perfect arithmetic codes
• Classification of MDS codes over small alphabets
• On the binary codes with parameters of doubly-shortened 1-perfect codes
• A characterization of 1-perfect additive codes
• Efficient representation of binary nonlinear codes: constructions and minimum distance computation
• The partial order of perfect codes associated to a perfect code
• Embedding in \(q\)-ary 1-perfect codes and partitions
• On binary 1-perfect additive codes: some structural properties
• On non-full-rank perfect codes over finite fields
• On nonlinear 1-quasi-perfect codes and their structural properties
• Parity check systems of nonlinear codes over finite commutative Frobenius rings

This page was built for publication: On perfect \(p\)-ary codes of length \(p+1\)

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