On perfect p-ary codes of length p+1
From MaRDI portal
Publication:1008963
DOI10.1007/S10623-007-9133-YzbMATH Open1178.94238OpenAlexW1977128710MaRDI QIDQ1008963FDOQ1008963
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
Recommendations
- scientific article
- 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
- Title not available (Why is that?)
- A General Product Construction for Error Correcting Codes
- Title not available (Why is that?)
- Ranks of \(q\)-ary 1-perfect codes
- Nonequivalent q-Ary Perfect Codes
- On linear and nonlinear single-error-correcting q-nary perfect codes
- More coverings by rook domains
- Title not available (Why is that?)
- Perfect codes from the dual point of view. I
- A generalized Lloyd theorem and mixed perfect codes.
- A full rank perfect code of length 31
- Perfect codes hardly exist
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
- On Group and Nongroup Perfect Codes in $q$ Symbols.
Cited In (15)
- Comments on "A note on perfect arithmetic codes
- On binary 1-perfect additive codes: some structural properties
- Parity check systems of nonlinear codes over finite commutative Frobenius rings
- Shortening Array Codes and the Perfect $1$-Factorization Conjecture
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- Title not available (Why is that?)
- Classification of MDS codes over small alphabets
- Embedding in \(q\)-ary 1-perfect codes and partitions
- On the classification of perfect codes: extended side class structures
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
- On the binary codes with parameters of doubly-shortened 1-perfect codes
- On nonlinear 1-quasi-perfect codes and their structural properties
- On non-full-rank perfect codes over finite fields
- The partial order of perfect codes associated to a perfect code
- A characterization of 1-perfect additive codes
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)
