Showing cs.ITShow all
2 papers · 1 filter
cs.IT2025
Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
Qingqing Peng, Ke Liu, Guiying Yan +1
It is well known that, given \(b\ge 0\), finding an -trapping set with the minimum \(a\) in a binary linear code is NP-hard. In this paper, we demonstrate that this problem…
cs.IT2023
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods
Haoran Xiong, Zicheng Ye, Huazi Zhang +6
Elementary trapping sets (ETSs) are the main culprits for the performance of LDPC codes in the error floor region. Due to the large quantity, complex structures, and computational…