MDS array codes with independent parity symbols
From MaRDI portal
Publication:4885683
DOI10.1109/18.485722zbMath0858.94028OpenAlexW2166011389MaRDI QIDQ4885683
Jehoshua Bruck, Mario Blaum, Alexander Vardy
Publication date: 28 July 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit96
MDS codesefficient decodingaverage number of parity bitsmaximum distance separable array codesparity symboltwo-and three-column errors
Related Items (10)
On encoding symbol degrees of array BP-XOR codes ⋮ Centralized key distribution protocol using the greatest common divisor method ⋮ Zigzag decodable codes: linear-time erasure codes with applications to data storage ⋮ Linear programming bounds for distributed storage codes ⋮ A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes ⋮ Optimizing large data transfers in parity-declustered data layouts ⋮ Factorization of determinants over finite fields and application in stream ciphers ⋮ Codes for Distributed Storage ⋮ Maximum Distance Separable Codes Based on Circulant Cauchy Matrices ⋮ Recovering erasures by using MDS codes over extension alphabets
This page was built for publication: MDS array codes with independent parity symbols
