By puncturing the Reed–Solomon codes with the block lengths of 2m, it is possible to design systematic and nonsystematic codes with arbitrary block lengths and rates that can be decoded using FFT. Because the Reed–Solomon (RS) codes are maximum distance separable (MDS), the resultant codes keep this property as well. The codes are constructed over prime fields as opposed to the conventional practice of extension fields, and hence additions and multiplications are simple mod operations and there is no need to use polynomials and look-up tables.
References
-
-
1)
-
C. Feyling
.
Punctured maximum distance separable codes.
Electron. Lett.
,
5 ,
470 -
471
-
2)
-
S.B. Wicker ,
V.K. Bhargava
.
(1994)
Reed–Solomon codes and their applications.
-
3)
-
R.E. Blahut
.
(1984)
Theory and practice of error control codes.
-
4)
-
N. Nejati ,
R. Dianat ,
P. Azmi ,
F. Marvasti
.
(2003)
Joint error concealment and channel coding for voice over IP applications. Proc. ISPACS 2003.
-
5)
-
Y. Xu ,
T. Zhang
.
Variable shortened-and-punctured Reed-Solomon codes for packet loss protection.
IEEE Trans. Broadcast.
,
3 ,
237 -
245
-
6)
-
S. Lin ,
D.J. Costello
.
(1983)
Error control coding: fundamentals and applications.
-
7)
-
R.E. Blahut
.
Algebraic fields, signal processing, and error control.
Proc. IEEE
,
5 ,
874 -
893
-
8)
-
R.E. Blahut
.
Transform techniques for error control codes.
IBM J. Res. Dev.
,
3 ,
299 -
315
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20045171
Related content
content/journals/10.1049/ip-com_20045171
pub_keyword,iet_inspecKeyword,pub_concept
6
6