On the classification of perfect codes: side class structures

DOI10.1007/S10623-006-0024-4zbMATH Open1205.94122OpenAlexW2084235719MaRDI QIDQ851765FDOQ851765

Authors: Olof Heden, Martin Hessler 

Publication date: 22 November 2006

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

Full work available at URL: https://doi.org/10.1007/s10623-006-0024-4

Recommendations

• Perfect codes as isomorphic spaces
• On the classification of perfect codes: extended side class structures
• Perfect codes from the dual point of view. I
• Switching equivalence classes of perfect codes
• On perfect codes: Rank and kernel

zbMATH Keywords

tilingsperfect codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• On Perfect Codes and Tilings: Problems and Solutions
• On perfect codes: Rank and kernel
• Perfect codes as isomorphic spaces
• Tilings of Binary Spaces
• Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
• On the ranks and kernels problem for perfect codes
• A full rank perfect code of length 31
• Perfect codes hardly exist
• Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist

Cited In (6)

• Switching equivalence classes of perfect codes
• Perfect codes as isomorphic spaces
• On kernels of perfect codes
• Perfect codes from the dual point of view. I
• Linear maps of perfect codes and irregular \(C\)-partitions
• On the classification of perfect codes: extended side class structures

This page was built for publication: On the classification of perfect codes: side class structures

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