Imagen de Portada

Computability of the Zero-Error Capacity of Noisy Channels

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Boche, Holger, Deppe, Christian
Formato:	Preprint
Publicado:	2020
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computability of the Channel Reliability Function and Related Bounds
por: Boche, Holger, et al.
Publicado: (2021)

Network Oblivious Transfer via Noisy Broadcast Channels
por: Aghaee, Hadi, et al.
Publicado: (2025)

Identification Capacity of the Discrete-Time Poisson Channel
por: Labidi, Wafa, et al.
Publicado: (2023)

On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations
por: Aghaee, Hadi, et al.
Publicado: (2026)

Optimal Codes for Deterministic Identification over Gaussian Channels: Closing the Capacity Gap
por: Colomer, Pau, et al.
Publicado: (2026)

Joint Identification and Sensing with Noisy Feedback: A Task-Oriented Communication Framework for 6G
por: Zhao, Yaning, et al.
Publicado: (2026)

Deterministic Identification Codes for Fading Channels
por: Vorobyev, Ilya, et al.
Publicado: (2024)

The Multiple-Access Channel with Entangled Transmitters
por: Pereg, Uzi, et al.
Publicado: (2023)

The Quantum Multiple-Access Channel with Cribbing Encoders
por: Pereg, Uzi, et al.
Publicado: (2021)

Function Computation and Identification over Locally Homomorphic Multiple-Access Channels
por: Rosenberger, Johannes, et al.
Publicado: (2024)

Joint Identification and Sensing for Discrete Memoryless Channels
por: Labidi, Wafa, et al.
Publicado: (2023)

Rate-Reliability Tradeoff for Deterministic Identification over Gaussian Channels
por: Colomer, Pau, et al.
Publicado: (2026)

Identification over Poisson ISI Channels: Feedback and Molecular Applications
por: Zhao, Yaning, et al.
Publicado: (2025)

Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels
por: Boche, Holger, et al.
Publicado: (2025)

Network Oblivious Transfer via Noisy Channels: Limits and Capacities
por: Aghaee, Hadi, et al.
Publicado: (2025)

Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels
por: Colomer, Pau, et al.
Publicado: (2025)

On Effective Convergence in Fekete's Lemma and Related Combinatorial Problems in Information Theory
por: Boche, Holger, et al.
Publicado: (2020)

Zero-entropy encoders and simultaneous decoders in identification via quantum channels
por: Colomer, Pau, et al.
Publicado: (2024)

Identification via Gaussian Multiple Access Channels in the Presence of Feedback
por: Zhao, Yaning, et al.
Publicado: (2024)

An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels
por: Zhao, Yaning, et al.
Publicado: (2024)

Joint Detection and Identification for Scalable Control of Nanorobot Swarms under Harsh Communication Constraints
por: Labidi, Wafa, et al.
Publicado: (2026)

Workshop on Information Theory and Related Fields -- In Memory of Ning Cai
por: Deppe, Christian, et al.
Publicado: (2024)

Deterministic identification for Bernoulli channels and related channels with continuous input
por: Colomer, Pau, et al.
Publicado: (2026)

Common Randomness Generation from Finite Compound Sources
por: Ezzine, Rami, et al.
Publicado: (2024)

Minimal Trellises for non-Degenerate and Degenerate Decoding of Quantum Stabilizer Codes
por: Stylianou, Evagoras, et al.
Publicado: (2024)

Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes
por: Lin, Pin-Hsun, et al.
Publicado: (2026)

Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates
por: Colomer, Pau, et al.
Publicado: (2024)

Rate-reliability tradeoff for deterministic identification
por: Colomer, Pau, et al.
Publicado: (2025)

Common Randomness Generation from Sources with Infinite Polish Alphabet
por: Labidi, Wafa, et al.
Publicado: (2024)

Security and Privacy: Key Requirements for Molecular Communication in Medicine and Healthcare
por: Gholamiyan, Vida, et al.
Publicado: (2025)

Secure Event-triggered MolecularvCommunication - Information Theoretic Perspective and Optimal Performance
por: Labidi, Wafa, et al.
Publicado: (2025)

Computing Capacity-Cost Functions for Continuous Channels in Wasserstein Space
por: Li, Xinyang, et al.
Publicado: (2025)

Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels
por: Boche, Holger, et al.
Publicado: (2025)

Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels
por: Boche, Holger, et al.
Publicado: (2026)

Complex Analysis of Channel Polarization on Discrete BMS Channels
por: Xu, Dongxiao, et al.
Publicado: (2026)

Computation of Capacity-Distortion-Cost Functions for Continuous Memoryless Channels
por: Li, Xinyang, et al.
Publicado: (2025)

On the Zero-Error Capacity of Semantic Channels with Input and Output Memories
por: Cao, Qi, et al.
Publicado: (2024)

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage
por: Chen, Yiqi, et al.
Publicado: (2026)

Ning Cai: A Tribute to a Pioneering Scholar in Information Theory
por: Althöfer, Ingo, et al.
Publicado: (2024)

On the Capacity of Noisy Frequency-based Channels
por: Gerzon, Yuval, et al.
Publicado: (2026)