Kernels of nonlinear Hamming codes

DOI10.1007/BF01388478zbMath0837.94028OpenAlexW2084383186MaRDI QIDQ1904424

Mike LeVan, Kevin T. Phelps

Publication date: 24 May 1996

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

Full work available at URL: https://doi.org/10.1007/bf01388478

zbMATH Keywords

kernelnonlinear Hamming codenonlinear perfect binary codes

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (15)

Affine 3-nonsystematic perfect codes of length 15 ⋮ On the structure of optimal error-correcting codes ⋮ Perfect binary codes of infinite length with complete system of triples ⋮ Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes ⋮ Perfect binary codes of infinite length ⋮ On Rank and Kernel of ℤ4-Linear Codes ⋮ On perfect binary codes ⋮ Embedding in a perfect code ⋮ STS-graphs of perfect codes mod kernel ⋮ \(Z_2Z_4\)-linear codes: rank and kernel ⋮ A new class of security oriented error correcting robust codes ⋮ Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. ⋮ Bounds on the rank and kernel of perfect codes ⋮ Affine 3-nonsystematic codes ⋮ On enumeration of the perfect binary codes of length 15

Cites Work

• Unnamed Item
• Algebraic techniques for nonlinear codes
• A binary perfect code of length 15 and codimension 0
• A General Product Construction for Error Correcting Codes
• A Combinatorial Construction of Perfect Codes
• Perfect binary codes: constructions, properties, and enumeration

This page was built for publication: Kernels of nonlinear Hamming codes