Notes 7 : Justesen codes , Reed - Solomon and concatenated codes decoding March 2010

Abstract

Given a specified rate target R, the construction involved a brute force search for the inner code Cin of rate r that met the Gilbert-Varshamov bound and had relative distance h−1(1 − r). Once such an inner code was found, it was used to encode each symbol of the outer Reed-Solomon code. This use of a search step left open the question of constructing fully… (More)

Topics

1 Figure or Table

Cite this paper

@inproceedings{Guruswami2010Notes7, title={Notes 7 : Justesen codes , Reed - Solomon and concatenated codes decoding March 2010}, author={Venkat Guruswami and Balakrishnan Narayanaswamy}, year={2010} }