Systematic MDS Erasure Codes Based on Vandermonde Matrices
Jérôme Lacan, Jérôme Fimes
Abstract
Open-access reader
Jérôme Lacan, Jérôme Fimes
Abstract
Open-access reader
An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes. This letter introduces new systematic MDS erasure codes constructed from two Vandermonde matrices. These codes have lower coding and decoding complexities than the others systematic MDS erasure codes.
OpenAlex reports 129 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An increasing number of applications in computer communications uses erasure codes to cope with packet losses. Systematic maximum-distance separable (MDS) codes are often the best adapted codes. This letter introduces new systematic MDS erasure codes constructed from two Vandermonde matrices. These codes have lower coding and decoding complexities than the others systematic MDS erasure codes.
Key concepts: Erasure code, Tornado code, Erasure, Computer science, Vandermonde matrix, Online codes, Fountain code, Decoding methods