Image de couverture de livre

The Optimization of Random Tree Codes for Limited Computational Resources

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bacinoglu, B. Tan
Format:	Preprint
Publié:	2025
Sujets:	Information Theory Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Punctured Low-Bias Codes Behave Like Random Linear Codes
par: Guruswami, Venkatesan, et autres
Publié: (2021)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
par: Doron, Dean, et autres
Publié: (2024)

Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity
par: Queiroz, Saulo, et autres
Publié: (2023)

Quantum Advantages in (n,d)->1 Random Access Codes
par: Ambainis, Andris, et autres
Publié: (2015)

Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
par: Wei, Jing-Yuan
Publié: (2026)

Oblivious Deletion Codes
par: Con, Roni, et autres
Publié: (2025)

Decoding Balanced Linear Codes With Preprocessing
par: Bogdanov, Andrej, et autres
Publié: (2025)

Advances in List Decoding of Polynomial Codes
par: Kumar, Mrinal, et autres
Publié: (2026)

Explicit Constant-Alphabet Subspace Design Codes
par: Goyal, Rohan, et autres
Publié: (2026)

High Rate Multivariate Polynomial Evaluation Codes
par: Kopparty, Swastik, et autres
Publié: (2024)

Improved List Size for Folded Reed-Solomon Codes
par: Srivastava, Shashank
Publié: (2024)

Explicit Codes approaching Generalized Singleton Bound using Expanders
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
par: Fawzi, Omar, et autres
Publié: (2023)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
par: Goyal, Rohan, et autres
Publié: (2025)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
par: Drucker, Andrew, et autres
Publié: (2024)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
par: Block, Alexander R., et autres
Publié: (2026)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
par: Blocki, Jeremiah, et autres
Publié: (2021)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
par: Doron, Dean, et autres
Publié: (2024)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
par: Jeronimo, Fernando Granha, et autres
Publié: (2026)

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
par: Moradi, Mohsen, et autres
Publié: (2024)

Communication with Imperfectly Shared Randomness
par: Canonne, Clément L., et autres
Publié: (2014)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
par: Cohen, Gil, et autres
Publié: (2025)

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

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
par: Janzer, Oliver, et autres
Publié: (2024)

LDPC Codes Achieve List Decoding Capacity
par: Mosheiff, Jonathan, et autres
Publié: (2019)

An exposition of recent list-size bounds of FRS Codes
par: Garg, Abhibhav, et autres
Publié: (2025)

Approximate Computation via Le Cam Simulability
par: Akdemir, Deniz
Publié: (2025)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
par: Brakensiek, Joshua, et autres
Publié: (2022)

Computable one-way functions on the reals
par: Barmpalias, George, et autres
Publié: (2024)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
par: Golowich, Louis, et autres
Publié: (2024)

Information Accessibility Limits in Structured NP Search
par: Wei, Jing-Yuan
Publié: (2026)

Algebra in Algorithmic Coding Theory
par: Sudan, Madhu
Publié: (2025)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
par: Alrabiah, Omar, et autres
Publié: (2024)

Random ensembles of symplectic and unitary states are indistinguishable
par: West, Maxwell, et autres
Publié: (2024)

Privacy-aware Berrut Approximated Coded Computing for Federated Learning
par: Luaña, Xavier Martínez, et autres
Publié: (2024)

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

Computational hardness of estimating quantum entropies via binary entropy bounds
par: Liu, Yupan
Publié: (2026)

Space-bounded online Kolmogorov complexity is additive
par: Bauwens, Bruno, et autres
Publié: (2025)

Deterministic list decoding of Reed-Solomon codes
par: Chatterjee, Soham, et autres
Publié: (2025)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
par: Li, Songsong, et autres
Publié: (2025)