Cover Image

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication

Fuente: arXiv

Saved in:

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

Similar Items

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
by: Ashvinkumar, Vikrant, et al.
Published: (2025)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
by: Peikert, Chris, et al.
Published: (2025)

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

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
by: Guruswami, Venkatesan, et al.
Published: (2023)

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

Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes
by: Ly, Hoang, et al.
Published: (2025)

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

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

Continuous Optimization for Decoding Errors
by: Srivastava, Shashank
Published: (2024)

Lower Bounds on Adaptive Sensing for Matrix Recovery
by: Kacham, Praneeth, et al.
Published: (2023)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
by: Brakensiek, Joshua, et al.
Published: (2025)

SpecTr: Fast Speculative Decoding via Optimal Transport
by: Sun, Ziteng, et al.
Published: (2023)

Uniform Universal Sets, Splitters, and Bisectors
by: Burjons, Elisabet, et al.
Published: (2025)

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

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

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

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

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

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

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
by: Chee, Yeow Meng, et al.
Published: (2023)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
by: Liu, Yang P.
Published: (2024)

Agnostic Private Density Estimation for GMMs via List Global Stability
by: Afzali, Mohammad, et al.
Published: (2024)

Entropic independence via sparse localization
by: Jain, Vishesh, et al.
Published: (2026)

Batch List-Decodable Linear Regression via Higher Moments
by: Diakonikolas, Ilias, et al.
Published: (2025)

Pcodec: Better Compression for Numerical Sequences
by: Loncaric, Martin, et al.
Published: (2025)

Old and New Results on Alphabetic Codes
by: Bruno, Roberto, et al.
Published: (2025)

Efficient $\varepsilon$-approximate minimum-entropy couplings
by: Compton, Spencer
Published: (2025)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
by: Smart, Bridget, et al.
Published: (2025)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

Kernels for Storage Capacity and Dual Index Coding
by: Haviv, Ishay
Published: (2025)

Hyperbolic Sets in Incomplete Tables
by: Bernal, J. J., et al.
Published: (2025)

Semidefinite Programming for the Asymmetric Stochastic Block Model
by: Gaudio, Julia, et al.
Published: (2025)

Testing (Conditional) Mutual Information
by: Seyfried, Jan, et al.
Published: (2025)

Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
by: Maier, Jakob, et al.
Published: (2025)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
by: Löffler, Maarten, et al.
Published: (2026)

A probabilistic analysis on general probabilistic scheduling problems
by: Suruga, Daiki
Published: (2024)

Key Compression Limits for $k$-Minimum Value Sketches
by: Dickens, Charlie, et al.
Published: (2024)

Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
by: Pettie, Seth, et al.
Published: (2020)

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
by: Wang, Ziao, et al.
Published: (2023)