Computer Science – Information Theory
Scientific paper
2010-06-16
Computer Science
Information Theory
18 pages, 3 figures, to appear on IEEE Transactions on Information Theory
Scientific paper
In this paper we study the decoding capabilities of convolutional codes over the erasure channel. Of special interest will be maximum distance profile (MDP) convolutional codes. These are codes which have a maximum possible column distance increase. We show how this strong minimum distance condition of MDP convolutional codes help us to solve error situations that maximum distance separable (MDS) block codes fail to solve. Towards this goal, we define two subclasses of MDP codes: reverse-MDP convolutional codes and complete-MDP convolutional codes. Reverse-MDP codes have the capability to recover a maximum number of erasures using an algorithm which runs backward in time. Complete-MDP convolutional codes are both MDP and reverse-MDP codes. They are capable to recover the state of the decoder under the mildest condition. We show that complete-MDP convolutional codes perform in certain sense better than MDS block codes of the same rate over the erasure channel.
Rosenthal Joachim
Smarandache Roxana
Tomás Virtudes
No associations
LandOfFree
Decoding of Convolutional Codes over the Erasure Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Decoding of Convolutional Codes over the Erasure Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding of Convolutional Codes over the Erasure Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-100196