A Hypergraph Filtering Based Iterative Decoding Approach for Linear Channel Codes
Efficient decoding for general linear channel codes has been a long standing problem. Message passing type algorithms can achieve near-optimal performance for channel codes with sparse check matrices and long code-lengths, but they may suffer from obvious performance loss when the aforementioned two...
Main Authors: | Jiaqi He, Ruyuan Qu, Chongbin Xu, Hui Feng, Xin Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9427505/ |
Similar Items
-
Subdivision of hypergraphs and their colorings
by: Moharram N. Iradmusa
Published: (2020-03-01) -
Branch-Assisted Sign-Flipping Belief Propagation Decoding for Topological Quantum Codes Based on Hypergraph Product Structure
by: Tzu-Hsuan Huang, et al.
Published: (2023-01-01) -
Hypergraph clustering by iteratively reweighted modularity maximization
by: Tarun Kumar, et al.
Published: (2020-08-01) -
Hypergraph seminar /
by: Working Seminar on Hypergraph (1st : 1972 : Ohio), et al.
Published: (1974) -
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
by: Kamble Lata N., et al.
Published: (2016-05-01)