Cover Image

Unbounded Error Correcting Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Efremenko, Klim, Zamir, Or
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
by: Li, Xin, et al.
Published: (2024)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
by: Ahmadypour, Niloufar, et al.
Published: (2020)

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

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

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

Perturbation-Resilient Trades for Dynamic Service Balancing
by: Sima, Jin, et al.
Published: (2024)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
by: Goldenberg, Elazar, et al.
Published: (2024)

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

Optimality of Frequency Moment Estimation
by: Braverman, Mark, et al.
Published: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
by: Hou, Jiaxin, et al.
Published: (2023)

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

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

A Method for Generating Connected Erdos-Renyi Random Graphs
by: Chinyaev, Boris
Published: (2025)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Improved Approximation Algorithms for Index Coding
by: Chawin, Dror, et al.
Published: (2024)

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

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

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

Investigations on Algorithm Selection for Interval-Based Coding Methods
by: Strutz, Tilo, et al.
Published: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
by: Bruno, Roberto, et al.
Published: (2024)

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

An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
by: Bar-Lev, Daniella, et al.
Published: (2026)

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

Testing Sumsets is Hard
by: Chen, Xi, et al.
Published: (2024)

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

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
by: Gharan, Shayan Oveis, et al.
Published: (2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
by: Bhattacharya, Sudatta, et al.
Published: (2025)

Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)

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)

Testability in group theory
by: Becker, Oren, et al.
Published: (2022)

Testability of relations between permutations
by: Becker, Oren, et al.
Published: (2020)

Optimal Differentially Private Sampling of Unbounded Gaussians
by: Iverson, Valentio, et al.
Published: (2025)

$k$-local Graphs
by: Beth, Christian, et al.
Published: (2024)

Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes
by: Green-Maimon, Naomi, et al.
Published: (2025)

Interactive Coding with Unbounded Noise
by: Fargion, Eden, et al.
Published: (2024)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

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