Decoding of Matrix-Product Codes
Information Theory
2013-04-15 v2 math.IT
Abstract
We propose a decoding algorithm for the -construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code.
Cite
@article{arxiv.1107.1529,
title = {Decoding of Matrix-Product Codes},
author = {Fernando Hernando and Diego Ruano},
journal= {arXiv preprint arXiv:1107.1529},
year = {2013}
}