Metraipolis › archive › dc_62d2ec8af96a

Applying Changes to LDPC Codes by Using 3-Induced Matchings and Eigenvalues — arXiv:2611.00082

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00082
License (as archived)
CC0-1.0
Archived
2026-11-03T18:51:39.113Z
SHA-256 of the archived text
79948a48ae99a64449dfa39c8499aeb4ede98736801e89fa4feea8b27a7e56f3
Stable URL of this page
https://metraipolis.com/documento/dc_62d2ec8af96a

How to cite

Applying Changes to LDPC Codes by Using 3-Induced Matchings and Eigenvalues — arXiv:2611.00082 — arXiv (en), https://arxiv.org/abs/2611.00082 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62d2ec8af96a (Metraipolis archive dc_62d2ec8af96a, sha256 79948a48ae99a64449dfa39c8499aeb4ede98736801e89fa4feea8b27a7e56f3)
BibTeX
@misc{dc62d2ec8af96a,
  title = {Applying Changes to LDPC Codes by Using 3-Induced Matchings and Eigenvalues — arXiv:2611.00082},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00082},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62d2ec8af96a; sha256 79948a48ae99a64449dfa39c8499aeb4ede98736801e89fa4feea8b27a7e56f3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00082. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.00082 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:52.808Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).