Journal article · Preprint article
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes
In
Advances in Mathematics of Communication
—
2012, Volume 6, Issue 3, pp. 259-272
Abstract
A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes.
Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units.
| Language: | English |
|---|---|
| Year: | 2012 |
| Pages: | 259-272 |
| ISSN: | 19305346 and 19305338 |
| Types: | Journal article and Preprint article |
| DOI: | 10.3934/amc.2012.6.259 |
