On a class of column‐weight 3 decomposable LDPC codes with the analysis of elementary trapping sets
Abstract A column‐weight k LDPC code with the parity‐check matrix H is called decomposable if there exists a permutation π on the rows of H, such that π(H) can be decomposed into k column‐weight one matrix. In this paper, some variations of edge coloring of graphs are used to construct some column‐w...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-06-01
|
| Series: | IET Communications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cmu2.12762 |