Graph Configurations and Decoding Performance

Authors:
J. T. Paire;P. Coulton;Patrick G. Farrell
Affiliations:
-;-;-
Venue:
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Year:
2001

Citing 3
Cited 0

On the BCJR trellis for linear block codes

IEEE Transactions on Information Theory
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Which codes have cycle-free Tanner graphs?

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of a new method for decoding binary error correcting codes is presented, and compared with established hard and soft decision decoding methods. The new method uses a modified form of the maxsum algorithm, which is applied to a split (partially disconnected) modification of the Tanner graph of the code. Most useful codes have Tanner graphs that contain cycles, so the aim of the split is to convert the graph into a tree graph. Various split graph configurations have been investigated, the best of which have decoding performances close to maximum likelihood.