Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

Performance Guarantees of SIC-Based Decoding for VLSF Codes in Hardcore-Regulated MAC

Abstract

Spatial regulation suffices to guarantee reliable, low-latency communication using variable-length stop-feedback (VLSF) codes over multiple access channels. The delay performance of VLSF codes under successive interference cancellation is characterized for transmitters within a coverage region. For deployments modeled by hardcore point processes, the signal-to-interference-plus-noise ratio (SINR) admits a positive lower bound for all transmitters within the coverage region. Under a predefined total error probability constraint, these transmitters are decodable within an upper-bounded delay. For each transmitter, the decoding delay is well approximated by an inverse Gaussian distribution parameterized by the codebook size, target error probability, and the SINR lower bound. Numerical results confirm that hardcore regulation provides uniform performance guarantees across links.

Related

  1. Achievability of CSS codes performance limits over Pauli channels under separate ML decoding with bounded graphical complexity
    Gulnihal Mercanoglu, Achilleas Anastasopoulos, S. Sandeep Pradhan
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  2. Algorithmic List Decoding of Reed-Solomon Codes up to Capacity
    Joshua Brakensiek, Yeyuan Chen, Aaron Putterman +2
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps
    Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Log Density Spectrum Based Decoding of Polar Codes for Channels with Strong Phase Noise
    Yinuo Mei, Daiming Qu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Estimation of the Label-Noise Transition Matrix with Performance Guarantees via Selective Classification
    Xabier de Juan, Santiago Mazuelas, Yilun Zhu +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{zagalo2026performance,
  title = {{Performance Guarantees of SIC-Based Decoding for VLSF Codes in Hardcore-Regulated MAC}},
  author = {Kevin Zagalo and Guodong Sun and Philippe Mary and Samir M. Perlaza and Jean-Marie Gorce},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37192},
  eprint = {2609.37192},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37192},
}
RIS
TY  - UNPB
TI  - Performance Guarantees of SIC-Based Decoding for VLSF Codes in Hardcore-Regulated MAC
AU  - Kevin Zagalo
AU  - Guodong Sun
AU  - Philippe Mary
AU  - Samir M. Perlaza
AU  - Jean-Marie Gorce
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37192
UR  - https://arxiv.org/abs/2609.37192
AB  - Spatial regulation suffices to guarantee reliable, low-latency communication using variable-length stop-feedback (VLSF) codes over multiple access channels. The delay performance of VLSF codes under successive interference cancellation is characterized for transmitters within a coverage region. For deployments modeled by hardcore point processes, the signal-to-interference-plus-noise ratio (SINR) admits a positive lower bound for all transmitters within the coverage region. Under a predefined total error probability constraint, these transmitters are decodable within an upper-bounded delay. For each transmitter, the decoding delay is well approximated by an inverse Gaussian distribution parameterized by the codebook size, target error probability, and the SINR lower bound. Numerical results confirm that hardcore regulation provides uniform performance guarantees across links.
ER  -