Computer Science – Information Theory
Scientific paper
2011-07-07
Computer Science
Information Theory
Scientific paper
We propose a decoding algorithm for the $(u\mid u+v)$-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.
Hernando Fernando
Ruano Diego
No associations
LandOfFree
Decoding of Matrix-Product Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decoding of Matrix-Product Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding of Matrix-Product Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-221652