On lowest density MDS codes
From MaRDI portal
Publication:4701286
DOI10.1109/18.746771zbMath0945.94028OpenAlexW2104812861MaRDI QIDQ4701286
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
Related Items (20)
On encoding symbol degrees of array BP-XOR codes ⋮ Construction of higher-level MDS matrices in nested SPNs ⋮ New Galois hulls of GRS codes and application to EAQECCs ⋮ Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions ⋮ MDS and near-MDS codes via twisted Reed-Solomon codes ⋮ Zigzag decodable codes: linear-time erasure codes with applications to data storage ⋮ New MDS self-dual codes over finite fields of odd characteristic ⋮ Systematic maximum sum rank codes ⋮ A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes ⋮ A note on the constructions of MDS self-dual codes ⋮ On the Construction of Lightweight Circulant Involutory MDS Matrices ⋮ Optimizing large data transfers in parity-declustered data layouts ⋮ Construction of MDS matrices from generalized Feistel structures ⋮ Construction of lightweight involutory MDS matrices ⋮ On Euclidean hulls of MDS codes ⋮ The permutation group insight on the diffusion property of linear mappings ⋮ Cycle codes of graphs and MDS array codes ⋮ Maximum Distance Separable Codes Based on Circulant Cauchy Matrices ⋮ New constructions of quantum MDS codes over finite fields ⋮ Recovering erasures by using MDS codes over extension alphabets
This page was built for publication: On lowest density MDS codes
