Image de couverture de livre

$q$-ary Sequential Locally Recoverable Codes from the Product Construction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Baghban, Akram, Newman, Marc, Horlemann, Anna-Lena, Ghiyasvand, Mehdi
Format:	Preprint
Publié:	2024
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

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

Distinguishers for Skew and Linearized Reed-Solomon Codes
par: Hörmann, Felicitas, et autres
Publié: (2026)

Equivalence of Families of Polycyclic Codes over Finite Fields
par: Ou-azzou, Hassan, et autres
Publié: (2025)

Bounds and Equivalence of Skew Polycyclic Codes over Finite Fields
par: Ou-azzou, Hassan, et autres
Publié: (2025)

On Lattice Constructions D and D' from q-ary Linear Codes
par: Silva, Franciele do Carmo, et autres
Publié: (2023)

Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems
par: Horlemann, Anna-Lena, et autres
Publié: (2024)

New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
par: Song, Wentu, et autres
Publié: (2024)

Dihedral Quantum Codes
par: Willenborg, Nadja, et autres
Publié: (2023)

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

The Subfield Metric and its Application to Quantum Error Correction
par: Grassl, Markus, et autres
Publié: (2022)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
par: Liu, Hengfeng, et autres
Publié: (2025)

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

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

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
par: Sarkar, Palash, et autres
Publié: (2024)

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

Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths
par: Yang, Zhiye, et autres
Publié: (2026)

The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem
par: Battagliola, Michele, et autres
Publié: (2026)

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

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
par: Pernice, Francisco, et autres
Publié: (2024)

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

Sharper upper bounds for $q$-ary and constant-weight $B_2$ codes
par: Della Fiore, Stefano
Publié: (2026)

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

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

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

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
par: Liang, Xue-Bin
Publié: (2024)

Finite Field Multiple Access III: from 2-ary to p-ary
par: Yu, Qi-yue
Publié: (2025)

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

Digit-Indexed q-ary SEC-DED Codes with Near-Hamming Overhead
par: Hu, Jiaxu, et autres
Publié: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
par: Gabrić, Daniel, et autres
Publié: (2024)

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

Locally Recoverable Codes with availability from a family of fibered surfaces
par: Salgado, Cecília, et autres
Publié: (2025)

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

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
par: Berman, Amit, et autres
Publié: (2026)

Upper bounds on the rate of linear $q$-ary $k$-hash codes
par: Della Fiore, Stefano, et autres
Publié: (2024)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
par: Tsui, Darin, et autres
Publié: (2025)

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

Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes
par: Galindo, Carlos, et autres
Publié: (2026)

DoDo-Code: an Efficient Levenshtein Distance Embedding-based Code for 4-ary IDS Channel
par: Guo, Alan J. X., et autres
Publié: (2023)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
par: Ge, Songping, et autres
Publié: (2025)

Four classes of optimal p-ary cyclic codes
par: Fan, Jinmei, et autres
Publié: (2025)