Cover Image

Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ly, Hoang, Soljanin, Emina
Format:	Preprint
Published:	2025
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
by: Ly, Hoang, et al.
Published: (2025)

Service Rate Regions of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
by: Ly, Hoang, et al.
Published: (2025)

On the Service Rate Region of Reed-Muller Codes
by: Ly, Hoang, et al.
Published: (2025)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
by: Ly, Hoang, et al.
Published: (2026)

On the Redundancy of Function-Correcting Codes over Finite Fields
by: Ly, Hoang, et al.
Published: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

Decoding rank metric Reed-Muller codes
by: Couvreur, Alain, et al.
Published: (2025)

The Service Rate Region Polytope
by: Alfarano, Gianira N., et al.
Published: (2023)

Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
by: Abbe, Emmanuel, et al.
Published: (2024)

Coxeter codes: Extending the Reed-Muller family
by: Coble, Nolan J., et al.
Published: (2025)

Geometric structure and transversal logic of quantum Reed-Muller codes
by: Barg, Alexander, et al.
Published: (2024)

On the Distance Distribution of Reed-Muller Codes
by: Kolekar, Neil
Published: (2026)

A Family of Low-Complexity Binary Codes with Constant Hamming Weights
by: Sasidharan, Birenjith, et al.
Published: (2024)

On the Parameters of Codes for Data Access
by: Kilic, Altan B., et al.
Published: (2024)

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

Winning Rates of $(n,k)$ Quantum Coset Monogamy Games
by: Schleppy, Michael, et al.
Published: (2025)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

On Optimal Batch Size in Coded Computing
by: Saha, Swapnil, et al.
Published: (2025)

On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes
by: Xia, Xuzhe, et al.
Published: (2025)

An Analysis of RPA Decoding of Reed-Muller Codes Over the BSC
by: Rameshwar, V. Arvind, et al.
Published: (2024)

Redundancy Management for Fast Service (Rates) in Edge Computing Systems
by: Peng, Pei, et al.
Published: (2023)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Tensor Reed-Muller Codes: Achieving Capacity with Quasilinear Decoding Time
by: Abbe, Emmanuel, et al.
Published: (2026)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
by: Brakensiek, Joshua, et al.
Published: (2022)

Binary Caps and LCD Codes with Large Dimensions
by: Ishizuka, Keita, et al.
Published: (2026)

CSS-T Codes from Reed Muller Codes
by: Andrade, Emma, et al.
Published: (2023)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
by: Doron, Dean, et al.
Published: (2024)

On the Error Probability of RPA Decoding of Reed-Muller Codes over BMS Channels
by: Fathollahi, Dorsa, et al.
Published: (2026)

On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
by: Heering, Philipp, et al.
Published: (2026)

On the number of inequivalent linearized Reed-Solomon codes
by: Mannaert, Jonathan, et al.
Published: (2026)

Optimal Strategies for Winning Certain Coset-Guessing Quantum Games
by: Schleppy, Michael, et al.
Published: (2024)

The Oval Strikes Back
by: Di Giusto, Andrea, et al.
Published: (2026)

Hardware Implementation of Projection-Aggregation Decoders for Reed-Muller Codes
by: Hashemipour-Nazari, Marzieh, et al.
Published: (2024)

More MDS codes of non-Reed-Solomon type
by: Wu, Yansheng, et al.
Published: (2024)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
by: Guo, Zeyu, et al.
Published: (2024)

Recursive Subproduct Codes with Reed-Muller-like Structure
by: Siddheshwar, Aditya, et al.
Published: (2024)

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

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Reed-Muller Codes for Joint Random and Stuck-At Error Correction
by: Djurdjevic, Ivana, et al.
Published: (2026)