Maximum distance separable poset codes
From MaRDI portal
Publication:1009045
DOI10.1007/S10623-008-9204-8zbMATH Open1178.94226OpenAlexW2067569336MaRDI QIDQ1009045FDOQ1009045
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Point sets and sequences with small discrepancy
- A combinatorial problem for vector spaces over finite fields
- Codes with a poset metric
- A Classification of Posets Admitting the MacWilliams Identity
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- Classification of perfect linear codes with crown poset structure
- The poset structures admitting the extended binary Hamming code to be a perfect code
Cited In (10)
- Projective systems and perfect codes with a poset metric.
- Codes with a pomset metric and constructions
- Simple proofs for duality of generalized minimum poset weights and weight distributions of (near-)MDS poset codes
- The covering problem in Rosenbloom-Tsfasman spaces
- Block codes in pomset metric over \(\mathbb{Z}_m\)
- Perfect codes in poset spaces and poset block spaces
- Block codes on pomset metric
- Title not available (Why is that?)
- MDS and \(I\)-perfect poset block codes
- Codes with respect to weighted poset block metric
This page was built for publication: Maximum distance separable poset codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009045)
