Imagen de Portada

List-Recovery of Random Linear Codes over Small Fields

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Doron, Dean, Mosheiff, Jonathan, Resch, Nicolas, Ribeiro, João
Formato:	Preprint
Publicado:	2025
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
por: Mosheiff, Jonathan, et al.
Publicado: (2024)

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

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

Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
por: Levi, Matan, et al.
Publicado: (2024)

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

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

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
por: Komech, Sergey, et al.
Publicado: (2025)

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
por: Resch, Nicolas, et al.
Publicado: (2025)

Nearly-Linear Time Seeded Extractors with Short Seeds
por: Doron, Dean, et al.
Publicado: (2024)

List Recovery for Random Low-Rate Linear Codes
por: Hair, Isaac M, et al.
Publicado: (2026)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Bounds for list-decoding and list-recovery of random linear codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Interactive Coding with Small Memory and Improved Rate
por: Fathollahi, Dorsa, et al.
Publicado: (2024)

Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)

On the weight distribution of random binary linear codes
por: Linial, Nati, et al.
Publicado: (2018)

Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound
por: Brehm, Martijn, et al.
Publicado: (2025)

On the List-Decodability of Random (Linear) Sum-Rank Metric Codes
por: Liu, Yang, et al.
Publicado: (2025)

On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography
por: Bombar, Maxime, et al.
Publicado: (2025)

Fly-PRAC: Packet Recovery for Random Linear Network Coding
por: Nazari, Hosein K., et al.
Publicado: (2026)

Characterization of Blind Code Rate Recovery in Linear Block Codes
por: Vedantam, Atreya, et al.
Publicado: (2026)

AG Codes Achieve List-decoding Capacity over Constant-sized Fields
por: Brakensiek, Joshua, et al.
Publicado: (2023)

Constructions and List Decoding of Sum-Rank Metric Codes Based on Orthogonal Spaces over Finite Fields
por: Liu, Xuemei, et al.
Publicado: (2025)

On Construction of Linear (Euclidean) Hull Codes over Finite Extensions Binary Fields
por: Bhowmick, Sanjit, et al.
Publicado: (2025)

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

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

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
por: Guo, Zeyu, et al.
Publicado: (2024)

On the Analysis of Random Linear Streaming Codes in Stochastic Channels
por: Huang, Kai, et al.
Publicado: (2025)

Endomorphisms of Linear Block Codes
por: Mandelbaum, Jonathan, et al.
Publicado: (2024)

Decoding Insertions/Deletions via List Recovery
por: Banerjee, Anisha, et al.
Publicado: (2025)

Construction of Complete Complementary Codes over Small Alphabet
por: Sarkar, Palash, et al.
Publicado: (2021)

Subcode Ensemble Decoding of Linear Block Codes
por: Mandelbaum, Jonathan, et al.
Publicado: (2025)

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

Zigzag Codes Revisited: From Optimal Rebuilding to Small Skip Cost and Small Fields
por: Zhang, Wenqin, et al.
Publicado: (2025)

Recovery Algorithms for Linear Batch Codes
por: Düzgün, Baran, et al.
Publicado: (2026)

On the Redundancy of Function-Correcting Codes over Finite Fields
por: Ly, Hoang, et al.
Publicado: (2025)

Equivalence of Families of Polycyclic Codes over Finite Fields
por: Ou-azzou, Hassan, et al.
Publicado: (2025)

On Permutation Groups of Cyclic Codes over Finite Fields
por: Huang, Junjie, et al.
Publicado: (2026)

Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$
por: Li, Yuting, et al.
Publicado: (2025)

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
por: Ron-Zewi, Noga, et al.
Publicado: (2024)

On the Stochastic Analysis of Random Linear Streaming Codes in Multi-Hop Relay Networks
por: Huang, Kai, et al.
Publicado: (2025)