← 研踪 PaperTrailarXiv:2611.00082 · v2
Applying Changes to LDPC Codes by Using 3-Induced Matchings and Eigenvalues
首次提交 2026-10-19 01:45
版本更新 2026-11-16 02:18
雷达观测 2026-11-17 17:12
摘要
The 2-switch operation for reducing the number of short cycles in Tanner graphs of LDPC codes has been utilized in some works. If this operation is appropriately applied to a 2-induced matching in a bipartite graph, then it surely preserves the bipartiteness of the graph. With a 2-induced matching, we have only one choice for applying this type of change to the graph. Using 3-induced matchings creates more potential and flexibility to apply certain changes to the Tanner graph. We present a necessary and sufficient condition for the existence of a 3-induced matching in bipartite graphs with girth at least 6. A 3-induced matching helps us to have more choices for applying a change to a bipartite graph while surely preserving the bipartiteness of the graph and keeping the degree sequences unchanged. Among all changes that we consider, we select the best change for reducing the number of cycles of length 6. The eigenvalues of subgraphs are used to reach a 3-induced matching, and a condition in some steps can be checked to ensure that the subgraph has at least one 3-induced matching. We present some numerical results regarding the steps at which the condition that guarantees the existence of a 3-induced matching is checked.
作者备注:Minor revisions and an additional figure
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-16 02:18 · 最新观测版本
Applying Changes to LDPC Codes by Using 3-Induced Matchings and Eigenvalues
The 2-switch operation for reducing the number of short cycles in Tanner graphs of LDPC codes has been utilized in some works. If this operation is appropriately applied to a 2-induced matching in a bipartite graph, then it surely preserves the bipartiteness of the graph. With a 2-induced matching, we have only one choice for applying this type of change to the graph. Using 3-induced matchings creates more potential and flexibility to apply certain changes to the Tanner graph. We present a necessary and sufficient condition for the existence of a 3-induced matching in bipartite graphs with girth at least 6. A 3-induced matching helps us to have more choices for applying a change to a bipartite graph while surely preserving the bipartiteness of the graph and keeping the degree sequences unchanged. Among all changes that we consider, we select the best change for reducing the number of cycles of length 6. The eigenvalues of subgraphs are used to reach a 3-induced matching, and a condition in some steps can be checked to ensure that the subgraph has at least one 3-induced matching. We present some numerical results regarding the steps at which the condition that guarantees the existence of a 3-induced matching is checked.
查看此版本解读 →查看此版本原文 ↗