:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Bacinoglu, B. Tan
Formato:	Preprint
Publicado:	2025
Materias:	Information Theory Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2501.12834
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Punctured Low-Bias Codes Behave Like Random Linear Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2021)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
por: Doron, Dean, et al.
Publicado: (2024)

Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity
por: Queiroz, Saulo, et al.
Publicado: (2023)

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
por: Wei, Jing-Yuan
Publicado: (2026)

Quantum Advantages in (n,d)->1 Random Access Codes
por: Ambainis, Andris, et al.
Publicado: (2015)

Oblivious Deletion Codes
por: Con, Roni, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

Communication with Imperfectly Shared Randomness
por: Canonne, Clément L., et al.
Publicado: (2014)

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

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

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

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
por: Cohen, Gil, et al.
Publicado: (2025)

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

LDPC Codes Achieve List Decoding Capacity
por: Mosheiff, Jonathan, et al.
Publicado: (2019)

Approximate Computation via Le Cam Simulability
por: Akdemir, Deniz
Publicado: (2025)

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

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

Generic Reed-Solomon Codes Achieve List-decoding Capacity
por: Brakensiek, Joshua, et al.
Publicado: (2022)

Computable one-way functions on the reals
por: Barmpalias, George, et al.
Publicado: (2024)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
por: Golowich, Louis, et al.
Publicado: (2024)

Information Accessibility Limits in Structured NP Search
por: Wei, Jing-Yuan
Publicado: (2026)

Algebra in Algorithmic Coding Theory
por: Sudan, Madhu
Publicado: (2025)

Random ensembles of symplectic and unitary states are indistinguishable
por: West, Maxwell, et al.
Publicado: (2024)

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

Privacy-aware Berrut Approximated Coded Computing for Federated Learning
por: Luaña, Xavier Martínez, et al.
Publicado: (2024)

Improved Decoding of Tanner Codes
por: Zhou, Zhaienhe, et al.
Publicado: (2025)

Computational hardness of estimating quantum entropies via binary entropy bounds
por: Liu, Yupan
Publicado: (2026)

Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
por: Azadi, Poria
Publicado: (2025)

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

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