Cargando…
Three Efficient All-Erasure Decoding Methods for Blaum–Roth Codes
Blaum–Roth Codes are binary maximum distance separable (MDS) array codes over the binary quotient ring [Formula: see text] , where [Formula: see text] , and p is a prime number. Two existing all-erasure decoding methods for Blaum–Roth codes are the syndrome-based decoding method and the interpolatio...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601635/ https://www.ncbi.nlm.nih.gov/pubmed/37420519 http://dx.doi.org/10.3390/e24101499 |
Sumario: | Blaum–Roth Codes are binary maximum distance separable (MDS) array codes over the binary quotient ring [Formula: see text] , where [Formula: see text] , and p is a prime number. Two existing all-erasure decoding methods for Blaum–Roth codes are the syndrome-based decoding method and the interpolation-based decoding method. In this paper, we propose a modified syndrome-based decoding method and a modified interpolation-based decoding method that have lower decoding complexity than the syndrome-based decoding method and the interpolation-based decoding method, respectively. Moreover, we present a fast decoding method for Blaum–Roth codes based on the LU decomposition of the Vandermonde matrix that has a lower decoding complexity than the two modified decoding methods for most of the parameters. |
---|