Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks

Files

Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks.pdf (827.96 KB)

Date

1992

Authors

Radosavljevic, B.
Arikan, E.
Hajek, B.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

IEEE Transactions on Information Theory

Print ISSN

189448

Electronic ISSN

Publisher

Volume

38

Issue

6

Pages

1833 - 1839

Language

English

Type

Article

Journal Title

Journal ISSN

Volume Title

Citation Stats
Attention Stats
Usage Stats
1
views
25
downloads

Series

Abstract

Decoding algorithms are investigated in which unpruned codeword trees are generated from an ordered list of parity checks. The order is computed from the received message, and low-density parity-check codes are used to help control the growth of the tree. Simulation results are given for the binary erasure channel. © 1992 IEEE

Course

Other identifiers

Book Title

Keywords

Algorithms, Computer simulation, Trees (mathematics), Adaptive reordering, Binary erasure channels, Decoding algorithms, Parity check codes, Sequential coding, Decoding

Degree Discipline

Degree Level

Degree Name

Citation

Permalink

http://hdl.handle.net/11693/26148

Published Version (Please cite this version)

http://dx.doi.org/10.1109/18.165462

Collections

Scholarly Publications - Electrical and Electronics Engineering