Imagen de Portada

Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pang, James Chin-Jen, Pradhan, Sandeep, Mahdavifar, Hessam
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

High-Rate Fair-Density Parity-Check Codes
por: Mahdavifar, Hessam
Publicado: (2024)

Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds
por: Rabeti, Sheida, et al.
Publicado: (2026)

Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels
por: Mahdavifar, Hessam, et al.
Publicado: (2024)

List Decoding and New Bicycle Code Constructions for Quantum LDPC Codes
por: Rabeti, Sheida, et al.
Publicado: (2025)

Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes
por: Rabeti, Sheida, et al.
Publicado: (2026)

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
por: Moradi, Mohsen, et al.
Publicado: (2024)

On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization
por: Moradi, Mohsen, et al.
Publicado: (2025)

Bounds on the Statistical Leakage-Resilience of Shamir's Secret Sharing
por: Gupta, Utkarsh, et al.
Publicado: (2024)

Efficient Low-Memory Fast Stack Decoding with Variance Polarization for PAC Codes
por: Moradi, Mohsen, et al.
Publicado: (2025)

Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs
por: Rabeti, Sheida, et al.
Publicado: (2025)

Efficient Covering Using Reed--Solomon Codes
por: Riasat, Samin, et al.
Publicado: (2025)

Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes
por: Riasat, Samin, et al.
Publicado: (2024)

Layered Normalized Min-Sum Decoding with Bit Flipping for FDPC Codes
por: Hosseinzadeh, Niloufar, et al.
Publicado: (2025)

Subspace Coding for Spatial Sensing
por: Mahdavifar, Hessam, et al.
Publicado: (2024)

A New Metric Function for SC-based Polar Decoders: Polarization, Pruning, and Fast Decoders
por: Moradi, Mohsen, et al.
Publicado: (2024)

Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory
por: Cao, Michael X., et al.
Publicado: (2019)

Covering in Hamming and Grassmann Spaces: New Bounds and Reed--Solomon-Based Constructions
por: Riasat, Samin, et al.
Publicado: (2025)

When Wyner and Ziv Met Bayes in Quantum-Classical Realm
por: Sohail, Mohammad Aamir, et al.
Publicado: (2025)

On the Strong Converse Exponent and Error Exponent of the Classical Soft Covering
por: He, Xingyi, et al.
Publicado: (2024)

On the Error Exponent Distribution of Code Ensembles over Classical-Quantum Channels
por: Cocco, Giuseppe, et al.
Publicado: (2025)

Polar Codes for Erasure and Unital Classical-Quantum Markovian Channels
por: Mandalapu, Jaswanthi, et al.
Publicado: (2025)

Simultaneous Decoding of Classical Coset Codes over $3-$User Quantum Broadcast Channel: New Achievable Rate Regions
por: Gouiaa, Fatma, et al.
Publicado: (2025)

Reliability Function of Classical-Quantum Channels
por: Li, Ke, et al.
Publicado: (2024)

One-Shot Secret Sharing with Monotone Access Structures over Classical-Quantum Broadcast Channels
por: Welling, Truman, et al.
Publicado: (2026)

An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels
por: Gouiaa, Fatma, et al.
Publicado: (2022)

On Finite-Blocklength Noisy Classical-Quantum Channel Coding With Amplitude Damping Errors
por: Havas, Tamás, et al.
Publicado: (2025)

Query Complexity of Classical and Quantum Channel Discrimination
por: Nuradha, Theshani, et al.
Publicado: (2025)

Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding
por: Yao, Yuhang, et al.
Publicado: (2026)

Infinite-fold Asymptotic Quantum Advantage in Classical Correlation Sensing
por: Nötzel, Janis, et al.
Publicado: (2025)

Generalized Fractional Repetition Codes for Binary Coded Computations
por: Charalambides, Neophytos, et al.
Publicado: (2021)

Fundamental Limits of Covert Communication over Classical-Quantum Channels
por: Bullock, Michael S., et al.
Publicado: (2016)

Zero-Error List Decoding for Classical-Quantum Channels
por: Dalai, Marco, et al.
Publicado: (2026)

Quantum Soft Covering with Relative Entropy Criterion
por: He, Xingyi, et al.
Publicado: (2024)

Invariant Theory, Magic State Distillation, and Bounds on Classical Codes
por: Kalra, Amolak Ratan, et al.
Publicado: (2025)

Conclusive Identification Via Noisy Classical Channel: Superactivation and Quantum Advantage
por: Chattopadhyay, Anushko, et al.
Publicado: (2026)

Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding
por: Salek, Farzin, et al.
Publicado: (2024)

Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm
por: Takahashi, Koki, et al.
Publicado: (2026)

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
por: Kondo, Ruho, et al.
Publicado: (2026)

From Classical to Quantum: Explicit Classical Distributions Achieving Maximal Quantum $f$-Divergence
por: Lanier, Dimitri, et al.
Publicado: (2025)

Constructive Approaches to Perception-Aware Lossy Source Coding: Information-Theoretic Guidelines
por: Hussein, Ali, et al.
Publicado: (2026)