The optimal erasing strategy for concatenated codes

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 ru...

Full description

Saved in:
Bibliographic Details
Main Authors: Yi Hsuan, Coffey, J.T., Collins, O.M.
Format: Conference Proceeding
Language:English
Subjects:
Concatenated codes
Decoding
Error probability
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ISIT.1995.550397