Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes.
From MaRDI portal
Publication:2572990
DOI10.1007/s10623-004-3989-xzbMath1142.94388MaRDI QIDQ2572990
Josep Rifà, Kevin T. Phelps, Mercè Villanueva
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-004-3989-x
94B05: Linear codes (general theory)
Related Items
On perfect \(p\)-ary codes of length \(p+1\), New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
Cites Work
- Algebraic techniques for nonlinear codes
- Ranks of \(q\)-ary 1-perfect codes
- Switching equivalence classes of perfect codes
- On perfect codes: Rank and kernel
- Kernels of nonlinear Hamming codes
- On Perfect Codes and Tilings: Problems and Solutions
- Perfect binary codes: constructions, properties, and enumeration
- Nonequivalent q-Ary Perfect Codes
- On linear and nonlinear single-error-correcting q-nary perfect codes