Cover Image

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Moradi, Mohsen, Mahdavifar, Hessam
Format:	Preprint
Published:	2024
Subjects:	Information Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
by: Block, Alexander R., et al.
Published: (2026)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)

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

High-Rate Fair-Density Parity-Check Codes
by: Mahdavifar, Hessam
Published: (2024)

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

Decoding Balanced Linear Codes With Preprocessing
by: Bogdanov, Andrej, et al.
Published: (2025)

Advances in List Decoding of Polynomial Codes
by: Kumar, Mrinal, et al.
Published: (2026)

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
by: Janzer, Oliver, et al.
Published: (2024)

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

Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)

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

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
by: Doron, Dean, et al.
Published: (2024)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

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

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
by: Goyal, Rohan, et al.
Published: (2025)

Improved Decoding of Tanner Codes
by: Zhou, Zhaienhe, et al.
Published: (2025)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

Deterministic list decoding of Reed-Solomon codes
by: Chatterjee, Soham, et al.
Published: (2025)

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds
by: Pang, James Chin-Jen, et al.
Published: (2024)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
by: Chen, Kean, et al.
Published: (2025)

PAC Code Rate-Profile Design Using Search-Constrained Optimization Algorithms
by: Moradi, Mohsen, et al.
Published: (2024)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
by: Goyal, Rohan, et al.
Published: (2025)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
by: Goyal, Rohan, et al.
Published: (2023)

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

High Rate Multivariate Polynomial Evaluation Codes
by: Kopparty, Swastik, et al.
Published: (2024)

Strong XOR Lemma for Information Complexity
by: Sawettamalya, Pachara, et al.
Published: (2024)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
by: Srivastava, Shashank, et al.
Published: (2025)

Improved List Size for Folded Reed-Solomon Codes
by: Srivastava, Shashank
Published: (2024)

The Optimization of Random Tree Codes for Limited Computational Resources
by: Bacinoglu, B. Tan
Published: (2025)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
by: Fawzi, Omar, et al.
Published: (2023)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
by: Li, Songsong, et al.
Published: (2025)