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

Simple item page
dc.citation.epage1839en_US
dc.citation.issueNumber6en_US
dc.citation.spage1833en_US
dc.citation.volumeNumber38en_US
dc.contributor.authorRadosavljevic, B.en_US
dc.contributor.authorArikan, E.en_US
dc.contributor.authorHajek, B.en_US
dc.date.accessioned2016-02-08T10:55:43Z
dc.date.available2016-02-08T10:55:43Z
dc.date.issued1992en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractDecoding 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 IEEEen_US
dc.identifier.doi10.1109/18.165462en_US
dc.identifier.issn189448
dc.identifier.urihttp://hdl.handle.net/11693/26148
dc.language.isoEnglishen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/18.165462en_US
dc.source.titleIEEE Transactions on Information Theoryen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer simulationen_US
dc.subjectTrees (mathematics)en_US
dc.subjectAdaptive reorderingen_US
dc.subjectBinary erasure channelsen_US
dc.subjectDecoding algorithmsen_US
dc.subjectParity check codesen_US
dc.subjectSequential codingen_US
dc.subjectDecodingen_US
dc.titleSequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checksen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Sequential Decoding of Low-Density Parity-Check Codes by Adaptive Reordering of Parity Checks.pdf
Size:
827.96 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download
Collections
Department of Electrical and Electronics Engineering