Metraipolis › archive › dc_0cce18ead01e

Diversity in Coded TE-QKD Channels: Achieving Infinite Diversity out of Finite System Resources — arXiv:2608.05432

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05432
License (as archived)
CC0-1.0
Archived
2026-10-28T03:04:08.214Z
SHA-256 of the archived text
c8113750f2665a7af5d29c31e3954db7d8f11f213f73d716608497738bdc9167
Stable URL of this page
https://metraipolis.com/documento/dc_0cce18ead01e

How to cite

Diversity in Coded TE-QKD Channels: Achieving Infinite Diversity out of Finite System Resources — arXiv:2608.05432 — arXiv (en), https://arxiv.org/abs/2608.05432 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0cce18ead01e (Metraipolis archive dc_0cce18ead01e, sha256 c8113750f2665a7af5d29c31e3954db7d8f11f213f73d716608497738bdc9167)
BibTeX
@misc{dc0cce18ead01e,
  title = {Diversity in Coded TE-QKD Channels: Achieving Infinite Diversity out of Finite System Resources — arXiv:2608.05432},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05432},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0cce18ead01e; sha256 c8113750f2665a7af5d29c31e3954db7d8f11f213f73d716608497738bdc9167},
  year = {2026}
}

Archived text

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

We establish conditions and give proofs on how an error-correcting code can attain infinite diversity in a time-entanglement quantum key distribution (TE-QKD) reconciliation. The shocking result, never encountered in the literature on coding and communication theory, is that a decoder exhibits an infinite diversity order while the channel has finite diversity and the code has a relatively short finite length. This paper studies the diversity order of coded TE-QKD reconciliation, defined by the asymptotic slope of the error probability at high signal-to-noise ratio. For bounded-distance algebraic decoding, we derive a necessary and sufficient condition in terms of the number of photons per codeword and the decoding radius. For soft-decision decoding, we introduce the maximal finite diversity (MFD) property and prove that infinite diversity is achieved if and only if the code is MFD deficient. The infinite diversity in TE-QKD has no counterpart in classical fading channels, where decoding can only multiply a finite diversity order by a finite factor. Examples of short codes based on Golay, Reed-Solomon, Bose-Chaudhuri-Hocquenghem (BCH), and Reed-Muller codes validate the analysis and illustrate how the TE-QKD system parameters and the relatively short code parameters affect the achievable diversity for both hard and soft information reconciliation.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-07 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.05432 — 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-10-28T03:02:08.395Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).