On lowest density MDS codes

DOI10.1109/18.746771zbMATH Open0945.94028OpenAlexW2104812861MaRDI QIDQ4701286FDOQ4701286

Authors: Mario Blaum, Ron M. Roth 

Publication date: 21 November 1999

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

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

Recommendations

• Lowest density MDS codes over extension alphabets
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• Sparse parity-check matrices over finite fields (extended abstract)
• A matrix characterization of Near-MDS codes.
• A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes

zbMATH Keywords

sparse matricesgroup codesmaximum-distance-separable codesparity-checklow-density codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Cited In (26)

• On Euclidean hulls of MDS codes
• Recovering erasures by using MDS codes over extension alphabets
• New constructions of quantum MDS codes over finite fields
• Sparse parity-check matrices over finite fields (extended abstract)
• On encoding symbol degrees of array BP-XOR codes
• New MDS self-dual codes over finite fields of odd characteristic
• On binary linear codes and binary pseudo-random sequences
• Construction of higher-level MDS matrices in nested SPNs
• New Galois hulls of GRS codes and application to EAQECCs
• MDS and near-MDS codes via twisted Reed-Solomon codes
• Optimizing large data transfers in parity-declustered data layouts
• Sparse Parity-Check Matrices over ${GF(q)}$
• Construction of MDS matrices from generalized Feistel structures
• Construction of lightweight involutory MDS matrices
• Maximum Distance Separable Codes Based on Circulant Cauchy Matrices
• Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
• Zigzag decodable codes: linear-time erasure codes with applications to data storage
• Additive codes with few weights
• The permutation group insight on the diffusion property of linear mappings
• On the Construction of Lightweight Circulant Involutory MDS Matrices
• A note on the constructions of MDS self-dual codes
• Cycle codes of graphs and MDS array codes
• Systematic maximum sum rank codes
• Lowest density MDS codes over extension alphabets
• A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes
• Low-density MDS codes and factors of complete graphs

This page was built for publication: On lowest density MDS codes

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