Published January 1, 2014
| Version v1
Journal article
Open
An integer programming-based search technique for error-prone structures of LDPC codes
- 1. Bogazici Univ, Dept Elect & Elect Engn, TR-34342 Istanbul, Turkey
- 2. Bogazici Univ, Dept Ind Engn, TR-34342 Istanbul, Turkey
Description
In this paper, an efficient, general framework is presented for finding common, devastating error-prone structures (EPS) of any finite-length low-density parity-check (LDPC) code. The smallest stopping set for the binary erasure channel (BEC), the smallest fully absorbing set, the smallest absorbing set, and the smallest elementary trapping set for the binary symmetric channel (BSC) are found and the dominant EPS are enumerated. The method involves integer programming optimization techniques, which guarantees that the results are provably optimal. (C) 2014 Elsevier GmbH. All rights reserved.
Files
bib-279f9997-a363-4386-9dcf-636da05a185f.txt
Files
(214 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:35b593f523c55c51c885aecc5aa461f9
|
214 Bytes | Preview Download |