Maximum distance separable poset codes

DOI10.1007/S10623-008-9204-8zbMath1178.94226OpenAlexW2067569336MaRDI QIDQ1009045

Jong Yoon Hyun, Hyun Kwang Kim

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-008-9204-8

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (6)

Perfect codes in poset spaces and poset block spaces ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ Block codes in pomset metric over \(\mathbb{Z}_m\) ⋮ Codes with respect to weighted poset block metric ⋮ Codes with a pomset metric and constructions ⋮ MDS and \(I\)-perfect poset block codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• The poset structures admitting the extended binary Hamming code to be a perfect code
• A combinatorial problem for vector spaces over finite fields
• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Classification of perfect linear codes with crown poset structure
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• Codes with a poset metric
• A Classification of Posets Admitting the MacWilliams Identity

This page was built for publication: Maximum distance separable poset codes