Saved in:
| Main Authors: | Xu, Dongxiao, Wiese, Moritz, Boche, Holger |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.03805 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Identification Capacity of the Discrete-Time Poisson Channel
by: Labidi, Wafa, et al.
Published: (2023)
by: Labidi, Wafa, et al.
Published: (2023)
Joint Identification and Sensing for Discrete Memoryless Channels
by: Labidi, Wafa, et al.
Published: (2023)
by: Labidi, Wafa, et al.
Published: (2023)
Computability of the Zero-Error Capacity of Noisy Channels
by: Boche, Holger, et al.
Published: (2020)
by: Boche, Holger, et al.
Published: (2020)
Computability of the Channel Reliability Function and Related Bounds
by: Boche, Holger, et al.
Published: (2021)
by: Boche, Holger, et al.
Published: (2021)
Common Randomness Generation from Finite Compound Sources
by: Ezzine, Rami, et al.
Published: (2024)
by: Ezzine, Rami, et al.
Published: (2024)
Deterministic Identification Codes for Fading Channels
by: Vorobyev, Ilya, et al.
Published: (2024)
by: Vorobyev, Ilya, et al.
Published: (2024)
Network Oblivious Transfer via Noisy Broadcast Channels
by: Aghaee, Hadi, et al.
Published: (2025)
by: Aghaee, Hadi, et al.
Published: (2025)
Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels
by: Boche, Holger, et al.
Published: (2025)
by: Boche, Holger, et al.
Published: (2025)
The Multiple-Access Channel with Entangled Transmitters
by: Pereg, Uzi, et al.
Published: (2023)
by: Pereg, Uzi, et al.
Published: (2023)
Common Randomness Generation from Sources with Infinite Polish Alphabet
by: Labidi, Wafa, et al.
Published: (2024)
by: Labidi, Wafa, et al.
Published: (2024)
Hierarchical Joint Source-Channel Coding with Constrained Information Leakage
by: Chen, Yiqi, et al.
Published: (2026)
by: Chen, Yiqi, et al.
Published: (2026)
Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes
by: Lin, Pin-Hsun, et al.
Published: (2026)
by: Lin, Pin-Hsun, et al.
Published: (2026)
The Quantum Multiple-Access Channel with Cribbing Encoders
by: Pereg, Uzi, et al.
Published: (2021)
by: Pereg, Uzi, et al.
Published: (2021)
Rate-Reliability Tradeoff for Deterministic Identification over Gaussian Channels
by: Colomer, Pau, et al.
Published: (2026)
by: Colomer, Pau, et al.
Published: (2026)
Identification over Poisson ISI Channels: Feedback and Molecular Applications
by: Zhao, Yaning, et al.
Published: (2025)
by: Zhao, Yaning, et al.
Published: (2025)
Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels
by: Boche, Holger, et al.
Published: (2025)
by: Boche, Holger, et al.
Published: (2025)
On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations
by: Aghaee, Hadi, et al.
Published: (2026)
by: Aghaee, Hadi, et al.
Published: (2026)
Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap
by: Colomer, Pau, et al.
Published: (2026)
by: Colomer, Pau, et al.
Published: (2026)
Capacity on BMS Channels via Code Symmetry and Nesting
by: Pfister, Henry D., et al.
Published: (2025)
by: Pfister, Henry D., et al.
Published: (2025)
Function Computation and Identification over Locally Homomorphic Multiple-Access Channels
by: Rosenberger, Johannes, et al.
Published: (2024)
by: Rosenberger, Johannes, et al.
Published: (2024)
On the Synthetic Channels in Polar Codes over Binary-Input Discrete Memoryless Channels
by: Jiao, Yadong, et al.
Published: (2025)
by: Jiao, Yadong, et al.
Published: (2025)
Identification via Gaussian Multiple Access Channels in the Presence of Feedback
by: Zhao, Yaning, et al.
Published: (2024)
by: Zhao, Yaning, et al.
Published: (2024)
Identification over Affine Poisson Channels: Application to Molecular Mixture Communication Systems
by: Salariseddigh, Mohammad Javad, et al.
Published: (2024)
by: Salariseddigh, Mohammad Javad, et al.
Published: (2024)
Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels
by: Colomer, Pau, et al.
Published: (2025)
by: Colomer, Pau, et al.
Published: (2025)
Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels
by: Boche, Holger, et al.
Published: (2026)
by: Boche, Holger, et al.
Published: (2026)
An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels
by: Zhao, Yaning, et al.
Published: (2024)
by: Zhao, Yaning, et al.
Published: (2024)
Exploiting Beamforming for Enforcing Semantic Secrecy in 5G NR mmWave Communications
by: Torres-Figueroa, Luis, et al.
Published: (2025)
by: Torres-Figueroa, Luis, et al.
Published: (2025)
An Achievable Rate-Distortion Region for Joint State and Message Communication over Multiple Access Channels
by: Li, Xinyang, et al.
Published: (2024)
by: Li, Xinyang, et al.
Published: (2024)
MambaCSP: Hybrid-Attention State Space Models for Hardware-Efficient Channel State Prediction
by: Djuhera, Aladin, et al.
Published: (2026)
by: Djuhera, Aladin, et al.
Published: (2026)
Stochastic Chase Decoding for BMS Channels via Rate Distortion Theory
by: Berman, Amit, et al.
Published: (2026)
by: Berman, Amit, et al.
Published: (2026)
On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
by: Fathollahi, Dorsa, et al.
Published: (2026)
by: Fathollahi, Dorsa, et al.
Published: (2026)
Computing Capacity-Cost Functions for Continuous Channels in Wasserstein Space
by: Li, Xinyang, et al.
Published: (2025)
by: Li, Xinyang, et al.
Published: (2025)
Computation of Capacity-Distortion-Cost Functions for Continuous Memoryless Channels
by: Li, Xinyang, et al.
Published: (2025)
by: Li, Xinyang, et al.
Published: (2025)
Robust Joint Message and State Transmission under Arbitrarily Varying Jamming
by: Chen, Yiqi, et al.
Published: (2025)
by: Chen, Yiqi, et al.
Published: (2025)
On the degradations of Binary-Input Discrete Memoryless Channels
by: Jiao, Yadong, et al.
Published: (2026)
by: Jiao, Yadong, et al.
Published: (2026)
Channel Polarization under Channel Noise with Memory
by: Qi, Tianfu, et al.
Published: (2024)
by: Qi, Tianfu, et al.
Published: (2024)
Stronger Polarization for the Deletion Channel
by: Arava, Dar, et al.
Published: (2023)
by: Arava, Dar, et al.
Published: (2023)
On the Arikan Transformations of Binary-Input Discrete Memoryless Channels
by: Jiao, Yadong, et al.
Published: (2025)
by: Jiao, Yadong, et al.
Published: (2025)
Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory
by: Boche, Holger, et al.
Published: (2024)
by: Boche, Holger, et al.
Published: (2024)
Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
by: Yao, Xinyuanmeng, et al.
Published: (2026)
by: Yao, Xinyuanmeng, et al.
Published: (2026)
Similar Items
-
Identification Capacity of the Discrete-Time Poisson Channel
by: Labidi, Wafa, et al.
Published: (2023) -
Joint Identification and Sensing for Discrete Memoryless Channels
by: Labidi, Wafa, et al.
Published: (2023) -
Computability of the Zero-Error Capacity of Noisy Channels
by: Boche, Holger, et al.
Published: (2020) -
Computability of the Channel Reliability Function and Related Bounds
by: Boche, Holger, et al.
Published: (2021) -
Common Randomness Generation from Finite Compound Sources
by: Ezzine, Rami, et al.
Published: (2024)