Study on short loops structure in LDPC-like sparse bipartite graphs based on graph kernel
Low-Density Parity-Check (LDPC) codes are widely used in communication systems for their ability to provide efficient and effective error correction. LDPC codes are based on sparse bipartite graphs, which are known to exhibit short cycles or loops that can affect their performance. In this report, I...
Saved in:
Main Author: | Alif Danial |
---|---|
Other Authors: | Erry Gunawan |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/167463 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Improving sparse coding with graph, kernel, and structure
by: Gao, Shenghua
Published: (2012) -
Application of bipartite graphs
by: Deng, Xiaohui
Published: (2009) -
Joint structured bipartite graph and row-sparse projection for large-scale feature selection
by: Dong, Xia, et al.
Published: (2024) -
BP-based sparse graph list decoding of polar codes
by: Liu, Han, et al.
Published: (2023) -
Performance comparison on graph-based sparse coding methods for face representation
by: Zhao, Xiaozhi
Published: (2015)