Saved in:
| Main Authors: | Bernal, J. J., Simón, J. J. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.17591 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Uniform Universal Sets, Splitters, and Bisectors
by: Burjons, Elisabet, et al.
Published: (2025)
by: Burjons, Elisabet, et al.
Published: (2025)
Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)
by: Ly, Hoang, et al.
Published: (2025)
List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
Pcodec: Better Compression for Numerical Sequences
by: Loncaric, Martin, et al.
Published: (2025)
by: Loncaric, Martin, et al.
Published: (2025)
List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
by: Peikert, Chris, et al.
Published: (2025)
by: Peikert, Chris, et al.
Published: (2025)
Old and New Results on Alphabetic Codes
by: Bruno, Roberto, et al.
Published: (2025)
by: Bruno, Roberto, et al.
Published: (2025)
Efficient $\varepsilon$-approximate minimum-entropy couplings
by: Compton, Spencer
Published: (2025)
by: Compton, Spencer
Published: (2025)
Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
by: Ashvinkumar, Vikrant, et al.
Published: (2025)
by: Ashvinkumar, Vikrant, et al.
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)
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)
by: Bruno, Roberto, et al.
Published: (2025)
Kernels for Storage Capacity and Dual Index Coding
by: Haviv, Ishay
Published: (2025)
by: Haviv, Ishay
Published: (2025)
Semidefinite Programming for the Asymmetric Stochastic Block Model
by: Gaudio, Julia, et al.
Published: (2025)
by: Gaudio, Julia, et al.
Published: (2025)
Testing (Conditional) Mutual Information
by: Seyfried, Jan, et al.
Published: (2025)
by: Seyfried, Jan, et al.
Published: (2025)
Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
by: Brakensiek, Joshua, et al.
Published: (2025)
by: Brakensiek, Joshua, et al.
Published: (2025)
Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
by: Maier, Jakob, et al.
Published: (2025)
by: Maier, Jakob, et al.
Published: (2025)
Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
by: Löffler, Maarten, et al.
Published: (2026)
by: Löffler, Maarten, et al.
Published: (2026)
A probabilistic analysis on general probabilistic scheduling problems
by: Suruga, Daiki
Published: (2024)
by: Suruga, Daiki
Published: (2024)
Key Compression Limits for $k$-Minimum Value Sketches
by: Dickens, Charlie, et al.
Published: (2024)
by: Dickens, Charlie, et al.
Published: (2024)
Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
by: Pettie, Seth, et al.
Published: (2020)
by: Pettie, Seth, et al.
Published: (2020)
Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
by: Wang, Ziao, et al.
Published: (2023)
by: Wang, Ziao, et al.
Published: (2023)
Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)
by: Guruswami, Venkatesan, et al.
Published: (2024)
Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)
by: Con, Roni, et al.
Published: (2024)
Investigations on Algorithm Selection for Interval-Based Coding Methods
by: Strutz, Tilo, et al.
Published: (2024)
by: Strutz, Tilo, et al.
Published: (2024)
Lower Bounds on Adaptive Sensing for Matrix Recovery
by: Kacham, Praneeth, et al.
Published: (2023)
by: Kacham, Praneeth, et al.
Published: (2023)
Graph Reconstruction from Noisy Random Subgraphs
by: McGregor, Andrew, et al.
Published: (2024)
by: McGregor, Andrew, et al.
Published: (2024)
More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
by: Ghentiyala, Surendra, et al.
Published: (2024)
by: Ghentiyala, Surendra, et al.
Published: (2024)
Continuous Optimization for Decoding Errors
by: Srivastava, Shashank
Published: (2024)
by: Srivastava, Shashank
Published: (2024)
A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities
by: Rivkin, Joey, et al.
Published: (2024)
by: Rivkin, Joey, et al.
Published: (2024)
Efficiency of ANS Entropy Encoders
by: Kosolobov, Dmitry
Published: (2022)
by: Kosolobov, Dmitry
Published: (2022)
Worst-case optimal adaptive alphabetic prefix-free coding
by: Gagie, Travis
Published: (2021)
by: Gagie, Travis
Published: (2021)
Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
by: Abraham, Hadas, et al.
Published: (2026)
by: Abraham, Hadas, et al.
Published: (2026)
Satisfying the Restricted Isometry Property with the Optimal Number of Rows and Slightly Less Randomness
by: Rao, Shravas
Published: (2023)
by: Rao, Shravas
Published: (2023)
Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)
Towards Optimal Grammars for RNA Structures
by: Onokpasa, Evarista, et al.
Published: (2024)
by: Onokpasa, Evarista, et al.
Published: (2024)
Scheduling Multi-Server Jobs is Not Easy
by: Vaze, Rahul
Published: (2024)
by: Vaze, Rahul
Published: (2024)
Tight bounds for stream decodable error-correcting codes
by: Gupta, Meghal, et al.
Published: (2024)
by: Gupta, Meghal, et al.
Published: (2024)
On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
by: Wang, Ziao, et al.
Published: (2022)
by: Wang, Ziao, et al.
Published: (2022)
An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
by: Bar-Lev, Daniella, et al.
Published: (2026)
by: Bar-Lev, Daniella, et al.
Published: (2026)
Improved Approximation Algorithms for Index Coding
by: Chawin, Dror, et al.
Published: (2024)
by: Chawin, Dror, et al.
Published: (2024)
Hardness and Approximability of Dimension Reduction on the Probability Simplex
by: Bruno, Roberto
Published: (2024)
by: Bruno, Roberto
Published: (2024)
Similar Items
-
Uniform Universal Sets, Splitters, and Bisectors
by: Burjons, Elisabet, et al.
Published: (2025) -
Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025) -
List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025) -
Pcodec: Better Compression for Numerical Sequences
by: Loncaric, Martin, et al.
Published: (2025) -
List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
by: Peikert, Chris, et al.
Published: (2025)