The following pages link to On lowest density MDS codes (Q4701286):
Displaying 20 items.
- Recovering erasures by using MDS codes over extension alphabets (Q258876) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- A note on the constructions of MDS self-dual codes (Q1733980) (← links)
- Construction of MDS matrices from generalized Feistel structures (Q2035449) (← links)
- Construction of lightweight involutory MDS matrices (Q2035451) (← links)
- On Euclidean hulls of MDS codes (Q2040328) (← links)
- New constructions of quantum MDS codes over finite fields (Q2111025) (← links)
- Construction of higher-level MDS matrices in nested SPNs (Q2124166) (← links)
- New Galois hulls of GRS codes and application to EAQECCs (Q2130034) (← links)
- MDS and near-MDS codes via twisted Reed-Solomon codes (Q2161429) (← links)
- New MDS self-dual codes over finite fields of odd characteristic (Q2182077) (← links)
- Systematic maximum sum rank codes (Q2191820) (← links)
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes (Q2194505) (← links)
- Optimizing large data transfers in parity-declustered data layouts (Q2256719) (← links)
- Zigzag decodable codes: linear-time erasure codes with applications to data storage (Q2402361) (← links)
- Cycle codes of graphs and MDS array codes (Q2851446) (← links)
- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices (Q2868656) (← links)
- The permutation group insight on the diffusion property of linear mappings (Q3382018) (← links)
- Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions (Q3455511) (← links)
- On the Construction of Lightweight Circulant Involutory MDS Matrices (Q4639474) (← links)
