Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields
From MaRDI portal
Publication:4983542
DOI10.1142/S0129054120500112zbMath1480.94040OpenAlexW3023498021MaRDI QIDQ4983542
Fang-Wei Fu, Gang Wang, Min-Yao Niu
Publication date: 20 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120500112
Searching and sorting (68P10) Linear codes (general theory) (94B05) Finite fields (field-theoretic aspects) (12E20)
Related Items (1)
Cites Work
- Unnamed Item
- Minimum distances of three families of low-density parity-check codes based on finite geometries
- Notes on binary codes related to the \(\mathrm{O}(5,q)\) generalized quadrangle for odd \(q\)
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Repair Locality With Multiple Erasure Tolerance
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
This page was built for publication: Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields