:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kumar, Vinayak M., Mon, Geoffrey
Format:	Preprint
Published:	2023
Subjects:	Computational Complexity Information Theory
Online Access:	https://arxiv.org/abs/2306.17035
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes
by: Grigorescu, Elena, et al.
Published: (2025)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
by: Block, Alexander R., et al.
Published: (2026)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
by: Janzer, Oliver, et al.
Published: (2024)

When Relaxation Does Not Help: RLDCs with Small Soundness Yield LDCs
by: Cheng, Kuan, et al.
Published: (2026)

Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
by: First, Uriya A., et al.
Published: (2024)

Advances in List Decoding of Polynomial Codes
by: Kumar, Mrinal, et al.
Published: (2026)

Deterministic list decoding of Reed-Solomon codes
by: Chatterjee, Soham, et al.
Published: (2025)

High Rate Multivariate Polynomial Evaluation Codes
by: Kopparty, Swastik, et al.
Published: (2024)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
by: Goyal, Rohan, et al.
Published: (2023)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
by: Goyal, Rohan, et al.
Published: (2025)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
by: Braverman, Mark, et al.
Published: (2025)

An exposition of recent list-size bounds of FRS Codes
by: Garg, Abhibhav, et al.
Published: (2025)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
by: Chen, Kean, et al.
Published: (2025)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
by: Bhandari, Siddharth, et al.
Published: (2021)

A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction
by: Chen, Zitan
Published: (2023)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
by: Fawzi, Omar, et al.
Published: (2023)

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

Space-bounded online Kolmogorov complexity is additive
by: Bauwens, Bruno, et al.
Published: (2025)

Decoding Balanced Linear Codes With Preprocessing
by: Bogdanov, Andrej, et al.
Published: (2025)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
by: Goyal, Rohan, et al.
Published: (2025)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
by: Drucker, Andrew, et al.
Published: (2024)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
by: Li, Songsong, et al.
Published: (2025)

Improved PIR Schemes using Matching Vectors and Derivatives
by: Ghasemi, Fatemeh, et al.
Published: (2024)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
by: Ming, Gao
Published: (2022)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
by: Doron, Dean, et al.
Published: (2024)

Kolmogorov-Loveland betting strategies lose the Betting game on open sets
by: Petrović, Tomislav
Published: (2024)

Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof
by: Bauwens, Bruno, et al.
Published: (2025)

Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
by: Ozelim, Luan, et al.
Published: (2024)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)

The Optimization of Random Tree Codes for Limited Computational Resources
by: Bacinoglu, B. Tan
Published: (2025)

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
by: Moradi, Mohsen, et al.
Published: (2024)

Half-duplex communication complexity with adversary can be less than the classical communication complexity
by: Dektiarev, Mikhail, et al.
Published: (2024)

Tight Quantum Time-Space Tradeoffs for Permutation Inversion
by: Akshima, et al.
Published: (2025)

Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Strong XOR Lemma for Information Complexity
by: Sawettamalya, Pachara, et al.
Published: (2024)

Some Thoughts on Symbolic Transfer Entropy
by: Jin, Dian
Published: (2024)

Improved List Size for Folded Reed-Solomon Codes
by: Srivastava, Shashank
Published: (2024)