Metraipolis › archive › dc_89df2f9dd22d

Block Erasure Channel and Block z-Channel with Bounded Decoders and Finite Blocklength — arXiv:2609.27519

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27519
License (as archived)
CC0-1.0
Archived
2026-10-08T12:11:58.735Z
SHA-256 of the archived text
ca0d5e99f0a166d2fac77a9dd3dbc1bd75433ebabc217c172c36bc9abaf8cc39
Stable URL of this page
https://metraipolis.com/documento/dc_89df2f9dd22d

How to cite

Block Erasure Channel and Block z-Channel with Bounded Decoders and Finite Blocklength — arXiv:2609.27519 — arXiv (en), https://arxiv.org/abs/2609.27519 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_89df2f9dd22d (Metraipolis archive dc_89df2f9dd22d, sha256 ca0d5e99f0a166d2fac77a9dd3dbc1bd75433ebabc217c172c36bc9abaf8cc39)
BibTeX
@misc{dc89df2f9dd22d,
  title = {Block Erasure Channel and Block z-Channel with Bounded Decoders and Finite Blocklength — arXiv:2609.27519},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27519},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_89df2f9dd22d; sha256 ca0d5e99f0a166d2fac77a9dd3dbc1bd75433ebabc217c172c36bc9abaf8cc39},
  year = {2026}
}

Archived text

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

Block error rate is a standard metric in finite blocklength (FBL) communication, yet it conflates two qualitatively different failure modes: block confusions, where the decoder selects a wrong codeword, and block erasures, where it declares a loss. Higher-layer protocols treat physical-layer failures as erasures, but this cross-layer assumption lacks FBL justification. We derive a rigorous upper bound and a companion lower-side estimate on the block confusion probability (BLCP) and block erasure probability (BLEP) for bounded-distance decoders over additive white Gaussian noise (AWGN) channels at finite blocklength, recasting the coding problem as a geometric sphere packing one. We analyze the sensitivity of these bounds to blocklength and signalto-noise ratio, characterize the envelope of the upper bound, and derive closed-form Chernoff approximations. Extending the model to idle transmission blocks, we bound the false alarm probability (FAP) and show that a block z-channel abstraction emerges from the bounded-decoding geometry. Numerical results confirm that confusion and false alarm probabilities lie far below the error rate constraint, providing quantitative physicallayer support for the block erasure channel and block z-channel abstractions assumed in protocol design.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.27519 — 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-08T12:10:03.922Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).