跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2606.11987 · v3

Graphical Analysis of Lifted Product Code Constructions

首次提交 2026-06-10 20:11
版本更新 2026-11-06 15:04
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices HXH_{\mathsf{X}} and HZH_{\mathsf{Z}}, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of HXH_{\mathsf{X}} and HZH_{\mathsf{Z}} are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-06 15:04 · 最新观测版本

Graphical Analysis of Lifted Product Code Constructions

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices HXH_{\mathsf{X}} and HZH_{\mathsf{Z}}, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of HXH_{\mathsf{X}} and HZH_{\mathsf{Z}} are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

查看此版本解读 →查看此版本原文 ↗