MDS and \(I\)-perfect poset block codes

DOI10.1016/J.FFA.2019.101620zbMath1452.94112OpenAlexW2995567762WikidataQ126530591 ScholiaQ126530591MaRDI QIDQ2302572

Namita Sharma, Bal Kishan Dass, Rashmi Verma

Publication date: 26 February 2020

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2019.101620

zbMATH Keywords

perfect codemaximum distance separable codeposet block metric

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Block codes in pomset metric over \(\mathbb{Z}_m\) ⋮ Codes with respect to weighted poset block metric

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Error-block codes and poset metrics
• Linear error-block codes
• Maximum distance separable poset codes
• A combinatorial problem for vector spaces over finite fields
• Codes for the \(m\)-metric
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• Codes with a poset metric
• The Poset Metrics That Allow Binary Codes of Codimension $m$ to be $m$-, $(m-1)$-, or $(m-2)$-Perfect
• Classification of Niederreiter–Rosenbloom–Tsfasman Block Codes
• Maximum distance<tex>q</tex>-nary codes

This page was built for publication: MDS and \(I\)-perfect poset block codes