Lowest density MDS codes over extension alphabets

DOI10.1109/TIT.2006.876235MaRDI QIDQ3547268zbMATH OpenFDO

Authors Erez Louidor, Ron M. Roth

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2006.876235

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• On lowest density MDS codes
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• Extending MDS codes
• On MDS extensions of generalized Reed- Solomon codes
• A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes

Cited in

(10)

• A note on the constructions of MDS self-dual codes
• A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
• Random construction of partial MDS codes
• Construction of MDS self-dual codes over finite fields
• Some new constructions of MDS self-dual codes over finite fields
• On encoding symbol degrees of array BP-XOR codes
• Low-density MDS codes and factors of complete graphs
• On lowest density MDS codes
• Additive codes with few weights
• Some optimal \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)

This page was built for publication: Lowest density MDS codes over extension alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547268)