Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
From MaRDI portal
Publication:1620962
Recommendations
Cites work
- A combinatorial problem for vector spaces over finite fields
- A survey of the different types of vector space partitions
- Canonical- systematic form for codes in hierarchical poset metrics
- Classification of perfect linear codes with crown poset structure
- Codes for the \(m\)-metric
- Codes with a poset metric
- Constructions and bounds on linear error-block codes
- Error-block codes and poset metrics
- Fundamentals of Error-Correcting Codes
- Group Partition, Factorization and the Vector Covering Problem
- Group Partitions and Mixed Perfect Codes
- Heden's bound on maximal partial spreads
- scientific article; zbMATH DE number 5759480 (Why is no real title available?)
- Linear and nonlinear single-error-correcting perfect mixed codes
- Linear error-block codes
- Maximal partial spreads and two-weight codes
- Point sets and sequences with small discrepancy
- Projective systems and perfect codes with a poset metric.
- The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces
- The poset structures admitting the extended binary Golay code to be a perfect code
- The poset structures admitting the extended binary Hamming code to be a perfect code
Cited in
(6)- Perfect codes in poset spaces and poset block spaces
- Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code
- Perfect codes in poset block spaces
- The poset structures admitting the extended binary Hamming code to be a perfect code
- The extended Golay codes considered as ideals
- The poset structures admitting the extended binary Golay code to be a perfect code
This page was built for publication: Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1620962)