DocumentCode :
2934621
Title :
The optimal erasing strategy for concatenated codes
Author :
Hsuan, Yi ; Coffey, John T. ; Collins, Oliver M.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fYear :
1995
fDate :
17-22 Sep 1995
Firstpage :
410
Abstract :
We consider the optimal strategy for erasing symbols in concatenated coding schemes. This erasing strategy uses a posteriori likelihoods of RS symbols to determine erasures which maximize the probability of decoding correctly. Some properties of performance of this strategy are presented. Erasing rules for decoding the same received word more than once are also examined
Keywords :
Reed-Solomon codes; concatenated codes; decoding; error statistics; probability; RS symbols; a posteriori likelihoods; concatenated codes; decoding; error probability; optimal erasing strategy; Concatenated codes; Decoding; Error probability; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
Type :
conf
DOI :
10.1109/ISIT.1995.550397
Filename :
550397
Link To Document :
بازگشت