Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds
<|reference_start|>Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds: We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new input probability distribution that incorporates the encoding homomorphism and the underlying channel law. Using a random coding argument, we characterize the performance of group codes in terms of hypothesis testing relative-entropic quantities. In the converse part, we establish bounds by leveraging a hypothesis testing-based approach. Furthermore, we apply the one-shot result to the asymptotic stationary memoryless setting, and establish a single-letter lower bound on group capacities for both classes of channels. Moreover, we derive a matching upper bound on the asymptotic group capacity.<|reference_end|>
@article{pang2024abelian,
    title={Abelian Group Codes for Classical and Classical-Quantum Channels:
  One-shot and Asymptotic Rate Bounds},
    author={James Chin-Jen Pang, Sandeep Pradhan, Hessam Mahdavifar},
    journal={arXiv preprint arXiv:2406.13243},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.13243},
    primaryClass={cs.IT math.IT}
}