Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
447573 | AEU - International Journal of Electronics and Communications | 2014 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Abdullah Sarıduman, Ali E. Pusane, Z. Caner Taşkın,