On perfect \(p\)-ary codes of length \(p+1\)
From MaRDI portal
Publication:1008963
DOI10.1007/S10623-007-9133-YzbMath1178.94238OpenAlexW1977128710MaRDI QIDQ1008963
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
Related Items (4)
Classification of MDS Codes over Small Alphabets ⋮ Parity check systems of nonlinear codes over finite commutative Frobenius rings ⋮ On non-full-rank perfect codes over finite fields ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ranks of \(q\)-ary 1-perfect codes
- More coverings by rook domains
- Perfect codes from the dual point of view. I
- A full rank perfect code of length 31
- Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
- A General Product Construction for Error Correcting Codes
- Perfect codes hardly exist
- A generalized Lloyd theorem and mixed perfect codes.
- Nonequivalent q-Ary Perfect Codes
- On linear and nonlinear single-error-correcting q-nary perfect codes
- On Group and Nongroup Perfect Codes in $q$ Symbols.
This page was built for publication: On perfect \(p\)-ary codes of length \(p+1\)
