Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
From MaRDI portal
Publication:1620962
DOI10.3934/AMC.2018037zbMath1402.94082OpenAlexW2893901612MaRDI QIDQ1620962
Namita Sharma, Bal Kishan Dass, Rashmi Verma
Publication date: 15 November 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018037
Related Items (1)
Cites Work
- Unnamed Item
- Point sets and sequences with small discrepancy
- The poset structures admitting the extended binary Hamming code to be a perfect code
- Error-block codes and poset metrics
- The poset structures admitting the extended binary Golay code to be a perfect code
- Linear error-block codes
- Constructions and bounds on linear error-block codes
- Maximal partial spreads and two-weight codes
- Heden's bound on maximal partial spreads
- A combinatorial problem for vector spaces over finite fields
- Codes for the \(m\)-metric
- Classification of perfect linear codes with crown poset structure
- Projective systems and perfect codes with a poset metric.
- Canonical- systematic form for codes in hierarchical poset metrics
- Codes with a poset metric
- The packing radius of a code and partitioning problems: the case for poset metrics on finite vector spaces
- A SURVEY OF THE DIFFERENT TYPES OF VECTOR SPACE PARTITIONS
- Group Partitions and Mixed Perfect Codes
- Fundamentals of Error-Correcting Codes
- Linear and nonlinear single-error-correcting perfect mixed codes
- Group Partition, Factorization and the Vector Covering Problem
This page was built for publication: Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces