Image de couverture de livre

Continuous Optimization for Decoding Errors

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Srivastava, Shashank
Format:	Preprint
Publié:	2024
Sujets:	Information Theory Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
par: Ashvinkumar, Vikrant, et autres
Publié: (2025)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
par: Srivastava, Shashank, et autres
Publié: (2025)

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
par: Brakensiek, Joshua, et autres
Publié: (2025)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
par: Peikert, Chris, et autres
Publié: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
par: Ly, Hoang, et autres
Publié: (2025)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Unbounded Error Correcting Codes
par: Efremenko, Klim, et autres
Publié: (2024)

Compression with Privacy-Preserving Random Access
par: Chandar, Venkat, et autres
Publié: (2025)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Improved Decoding of Tanner Codes
par: Zhou, Zhaienhe, et autres
Publié: (2025)

A Framework for Searching in Graphs in the Presence of Errors
par: Dereniowski, Dariusz, et autres
Publié: (2018)

A probabilistic analysis on general probabilistic scheduling problems
par: Suruga, Daiki
Publié: (2024)

Key Compression Limits for $k$-Minimum Value Sketches
par: Dickens, Charlie, et autres
Publié: (2024)

Capacity-Achieving Gray Codes
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Robust Gray Codes Approaching the Optimal Rate
par: Con, Roni, et autres
Publié: (2024)

Investigations on Algorithm Selection for Interval-Based Coding Methods
par: Strutz, Tilo, et autres
Publié: (2024)

Graph Reconstruction from Noisy Random Subgraphs
par: McGregor, Andrew, et autres
Publié: (2024)

More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
par: Ghentiyala, Surendra, et autres
Publié: (2024)

A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
par: Rivkin, Joey, et autres
Publié: (2024)

Towards Optimal Grammars for RNA Structures
par: Onokpasa, Evarista, et autres
Publié: (2024)

Scheduling Multi-Server Jobs is Not Easy
par: Vaze, Rahul
Publié: (2024)

Tight bounds for stream decodable error-correcting codes
par: Gupta, Meghal, et autres
Publié: (2024)

Improved Approximation Algorithms for Index Coding
par: Chawin, Dror, et autres
Publié: (2024)

Hardness and Approximability of Dimension Reduction on the Probability Simplex
par: Bruno, Roberto
Publié: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
par: Bruno, Roberto, et autres
Publié: (2024)

Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
par: Löffler, Maarten, et autres
Publié: (2026)

Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
par: Pettie, Seth, et autres
Publié: (2020)

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
par: Wang, Ziao, et autres
Publié: (2023)

Pcodec: Better Compression for Numerical Sequences
par: Loncaric, Martin, et autres
Publié: (2025)

Old and New Results on Alphabetic Codes
par: Bruno, Roberto, et autres
Publié: (2025)

Lower Bounds on Adaptive Sensing for Matrix Recovery
par: Kacham, Praneeth, et autres
Publié: (2023)

Efficient $\varepsilon$-approximate minimum-entropy couplings
par: Compton, Spencer
Publié: (2025)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
par: Smart, Bridget, et autres
Publié: (2025)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
par: Bruno, Roberto, et autres
Publié: (2025)

Efficiency of ANS Entropy Encoders
par: Kosolobov, Dmitry
Publié: (2022)

Worst-case optimal adaptive alphabetic prefix-free coding
par: Gagie, Travis
Publié: (2021)

Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
par: Abraham, Hadas, et autres
Publié: (2026)

Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
par: Rao, Shravas
Publié: (2023)