2000 character limit reached
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes (1201.6397v1)
Published 30 Jan 2012 in cs.IT and math.IT
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.