Recovering erasures by using MDS codes over extension alphabets
From MaRDI portal
Publication:258876
DOI10.1007/s40324-015-0057-6zbMath1397.94125OpenAlexW2269178746MaRDI QIDQ258876
Joan-Josep Climent, Sara D. Cardell
Publication date: 10 March 2016
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/62027
linear systemcompanion matrixprimitive polynomial\(\mathbb{F}_q\)-linear codeerasure channelsuperregular matrix
Uses Software
Cites Work
- On superregular matrices and MDP convolutional codes
- Asymptotically optimal erasure-resilient codes for large disk arrays.
- Polynomial Codes Over Certain Finite Fields
- On MDS codes via Cauchy matrices
- On generator matrices of MDS codes (Corresp.)
- Byte-Oriented Error-Correcting Codes for Semiconductor Memory Systems
- New array codes for multiple phased burst correction
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Switching codes for delta-I noise reduction
- On lowest density MDS codes
- MDS array codes with independent parity symbols
- Decoding of Convolutional Codes Over the Erasure Channel
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item