Maximum distance separable poset codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- A Classification of Posets Admitting the MacWilliams Identity
- A combinatorial problem for vector spaces over finite fields
- Classification of perfect linear codes with crown poset structure
- Codes with a poset metric
- Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Point sets and sequences with small discrepancy
- 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
- scientific article; zbMATH DE number 5901461 (Why is no real title available?)
- 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)