Image de couverture de livre

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Resch, Nicolas, Venkitesh, S.
Format:	Preprint
Publié:	2025
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
par: Ron-Zewi, Noga, et autres
Publié: (2024)

Polynomials, Divided Differences, and Codes
par: Venkitesh, S.
Publié: (2024)

List-Recovery of Random Linear Codes over Small Fields
par: Doron, Dean, et autres
Publié: (2025)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
par: Mosheiff, Jonathan, et autres
Publié: (2024)

Quantum Locally Recoverable Codes via Good Polynomials
par: Sharma, Sandeep, et autres
Publié: (2024)

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

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
par: Komech, Sergey, et autres
Publié: (2025)

List Privacy Under Function Recoverability
par: Nageswaran, Ajaykrishnan, et autres
Publié: (2023)

Game-Theoretic Cybersecurity: the Good, the Bad and the Ugly
par: Collins, Brandon, et autres
Publié: (2024)

Interactive Coding with Small Memory and Improved Rate
par: Fathollahi, Dorsa, et autres
Publié: (2024)

On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography
par: Bombar, Maxime, et autres
Publié: (2025)

Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound
par: Brehm, Martijn, et autres
Publié: (2025)

Maximal Recoverability: A Nexus of Coding Theory
par: Brakensiek, Joshua, et autres
Publié: (2026)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
par: Brakensiek, Joshua, et autres
Publié: (2025)

Secure Storage using Maximally Recoverable Locally Repairable Codes
par: Janz, Tim, et autres
Publié: (2024)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
par: Bastos, Gustavo Terra, et autres
Publié: (2024)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
par: Dang, Sakshi, et autres
Publié: (2026)

Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
par: Liu, Hengfeng, et autres
Publié: (2026)

$q$-ary Sequential Locally Recoverable Codes from the Product Construction
par: Baghban, Akram, et autres
Publié: (2024)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
par: Ly, Hoang, et autres
Publié: (2026)

Wealth Accumulation: The Good, the Bad and the Ugly
par: Stewart Lansley
Publié: (2024)

Game of Coding With an Unknown Adversary
par: Akbarinodehi, Hanzaleh, et autres
Publié: (2025)

Hierarchical Locally Recoverable Codes on surfaces
par: Araujo, Carolina, et autres
Publié: (2026)

List-Decodable Folded Quantum Hermitian Codes
par: Matthews, Gretchen L., et autres
Publié: (2026)

List Decoding and New Bicycle Code Constructions for Quantum LDPC Codes
par: Rabeti, Sheida, et autres
Publié: (2025)

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
par: Baghban, Akram, et autres
Publié: (2025)

Construction of Simultaneously Good Polar Codes and Polar Lattices
par: Liu, Ling, et autres
Publié: (2025)

Simplified Successive Cancellation List Decoding of PAC Codes
par: Saber, Hamid, et autres
Publié: (2024)

PAC Codes: Sequential Decoding vs List Decoding
par: Rowshan, Mohammad, et autres
Publié: (2020)

Reverse PAC Codes: Look-ahead List Decoding
par: Gu, Xinyi, et autres
Publié: (2024)

List Recovery for Random Low-Rate Linear Codes
par: Hair, Isaac M, et autres
Publié: (2026)

List-based Optimization of Proximal Decoding for LDPC Codes
par: Tsouchlos, Andreas, et autres
Publié: (2024)

List Decoding Bounds for Binary Codes with Noiseless Feedback
par: Gupta, Meghal, et autres
Publié: (2024)

Finite Alphabet Fast List Decoders for Polar Codes
par: Shah, Syed Aizaz Ali, et autres
Publié: (2024)

The Cumulants Expansion Approach: The Good, The Bad and The Ugly
par: Kerber, Johannes, et autres
Publié: (2025)

Coherent Ising Machines: The Good, The Bad, The Ugly
par: Khosravi, Farhad, et autres
Publié: (2025)

Low-Complexity Vector Source Coding for Discrete Long Sequences with Unknown Distributions
par: Woldemariam, Leah, et autres
Publié: (2023)

Similarity as Thermodynamic Work: Between Depth and Diversity -- from Information Distance to Ugly Duckling
par: Imafuku, Kentaro
Publié: (2025)

On the List-Decodability of Random (Linear) Sum-Rank Metric Codes
par: Liu, Yang, et autres
Publié: (2025)