Image de couverture de livre

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Komech, Sergey, Mosheiff, Jonathan
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

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)

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

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

Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
par: Levi, Matan, et autres
Publié: (2024)

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

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

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
par: Resch, Nicolas, et autres
Publié: (2025)

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

On the weight distribution of random binary linear codes
par: Linial, Nati, et autres
Publié: (2018)

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

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

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

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
par: Liu, Hongyang, et autres
Publié: (2026)

Construction of Complete Complementary Codes over Small Alphabet
par: Sarkar, Palash, et autres
Publié: (2021)

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

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

Old and New Results on Alphabetic Codes
par: Bruno, Roberto, et autres
Publié: (2025)

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

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

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)

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

LDPC Codes for Quantitative Group Testing with a Non-Binary Alphabet
par: Mashauri, Mgeni Makambi, et autres
Publié: (2024)

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

Near-Optimal List-Recovery of Linear Code Families
par: Li, Ray, et autres
Publié: (2025)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
par: Bruno, Roberto, et autres
Publié: (2024)

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

Multiple Spectrally Null Constrained Complete Complementary Codes of Various Lengths Over Small Alphabet
par: Kumar, Rajen, et autres
Publié: (2024)

Recursively Extended Permutation Codes under Chebyshev Distance
par: Hirobe, Tomoya, et autres
Publié: (2024)

On Permutation Groups of Cyclic Codes over Finite Fields
par: Huang, Junjie, et autres
Publié: (2026)

Bounds for list-decoding and list-recovery of random linear codes
par: Guruswami, Venkatesan, et autres
Publié: (2020)

Threshold rates for properties of random codes
par: Guruswami, Venkatesan, et autres
Publié: (2020)

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

Optimal and Suboptimal Decoders under Finite-Alphabet Interference: A Mismatched Decoding Perspective
par: Zhang, Sibo, et autres
Publié: (2025)

New Channel Coding Lower Bounds for Noisy Permutation Channels
par: Feng, Lugaoze, et autres
Publié: (2024)

Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
par: Heng, Ziling, et autres
Publié: (2025)

Random Permutation Codes: Lossless Source Coding of Non-Sequential Data
par: Severo, Daniel
Publié: (2024)

Common Randomness Generation from Sources with Infinite Polish Alphabet
par: Labidi, Wafa, et autres
Publié: (2024)