Perfect codes from the dual point of view. I
From MaRDI portal
Publication:998352
DOI10.1016/J.DISC.2007.11.037zbMATH Open1156.94017OpenAlexW1999220767MaRDI QIDQ998352FDOQ998352
Authors: Olof Heden 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.037
Recommendations
Cites Work
- Error detecting and error correcting codes
- On the reconstruction of perfect codes
- Title not available (Why is that?)
- On the Nonexistence of Perfect Codes over Finite Fields
- Title not available (Why is that?)
- A General Product Construction for Error Correcting Codes
- Codes of Steiner triple and quadruple systems
- On Perfect Codes and Tilings: Problems and Solutions
- Title not available (Why is that?)
- On perfect codes: Rank and kernel
- Title not available (Why is that?)
- On the classification of perfect codes: side class structures
- A generalized Lloyd theorem and mixed perfect codes.
- Title not available (Why is that?)
- On the ranks and kernels problem for perfect codes
- A full rank perfect code of length 31
- Title not available (Why is that?)
Cited In (38)
- Perfect binary codes: constructions, properties, and enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(e\)-perfect codes
- Title not available (Why is that?)
- Perfect codes as isomorphic spaces
- Title not available (Why is that?)
- On kernels of perfect codes
- STS-graphs of perfect codes mod kernel
- The classification of some perfect codes
- Embedding in a perfect code
- Parity check systems of nonlinear codes over finite commutative Frobenius rings
- On a property of perfect binary codes
- On perfect \(p\)-ary codes of length \(p+1\)
- On the reconstruction of perfect codes
- Perfect codes in additive channels
- Perfect 1-error-correcting Lipschitz weight codes
- Local duality theorem for \(q\)-ary 1-perfect codes
- On perfect-like binary and non-binary linear codes - a brief survey
- On perfect codes in rank distance
- Maximal partial packings of \(\mathbb Z_2^n\) with perfect codes
- A full rank perfect code of length 31
- Construction and classification of codes
- Perfect Codes of Length n with Kernels of Dimension $n-\log(n+1)-3$
- Linear maps of perfect codes and irregular \(C\)-partitions
- Perfect codes with distinct protective radii
- On rank and kernel of some mixed perfect codes
- On the classification of perfect codes: extended side class structures
- On linear equivalence and Phelps codes. Addendum
- Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
- On the classification of perfect codes: side class structures
- Title not available (Why is that?)
- A remark on full rank perfect codes
- Perfect codes and related structures
- Title not available (Why is that?)
- Linear perfect codes of infinite length over infinite fields
- A class of codes admitting at most three nonzero dual distances
- Perfect codes for metrics generated by primitive 2-error-correcting binary BCH codes
This page was built for publication: Perfect codes from the dual point of view. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998352)
