:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Baghban, Akram, Newman, Marc, Horlemann, Anna-Lena, Ghiyasvand, Mehdi
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2401.07835
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
by: Baghban, Akram, et al.
Published: (2025)

Distinguishers for Skew and Linearized Reed-Solomon Codes
by: Hörmann, Felicitas, et al.
Published: (2026)

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

Bounds and Equivalence of Skew Polycyclic Codes over Finite Fields
by: Ou-azzou, Hassan, et al.
Published: (2025)

Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems
by: Horlemann, Anna-Lena, et al.
Published: (2024)

On Lattice Constructions D and D' from q-ary Linear Codes
by: Silva, Franciele do Carmo, et al.
Published: (2023)

Dihedral Quantum Codes
by: Willenborg, Nadja, et al.
Published: (2023)

New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
by: Song, Wentu, et al.
Published: (2024)

The Subfield Metric and its Application to Quantum Error Correction
by: Grassl, Markus, et al.
Published: (2022)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
by: Bastos, Gustavo Terra, et al.
Published: (2024)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)

The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem
by: Battagliola, Michele, et al.
Published: (2026)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024)

Secure Storage using Maximally Recoverable Locally Repairable Codes
by: Janz, Tim, et al.
Published: (2024)

Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths
by: Yang, Zhiye, et al.
Published: (2026)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
by: Ly, Hoang, et al.
Published: (2026)

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
by: Pernice, Francisco, et al.
Published: (2024)

Hierarchical Locally Recoverable Codes on surfaces
by: Araujo, Carolina, et al.
Published: (2026)

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

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

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

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

Digit-Indexed q-ary SEC-DED Codes with Near-Hamming Overhead
by: Hu, Jiaxu, et al.
Published: (2025)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)

Finite Field Multiple Access III: from 2-ary to p-ary
by: Yu, Qi-yue
Published: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)

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

Locally Recoverable Codes with availability from a family of fibered surfaces
by: Salgado, Cecília, et al.
Published: (2025)

Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
by: Liu, Hengfeng, et al.
Published: (2026)

Upper bounds on the rate of linear $q$-ary $k$-hash codes
by: Della Fiore, Stefano, et al.
Published: (2024)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
by: Tsui, Darin, et al.
Published: (2025)

Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes
by: Galindo, Carlos, et al.
Published: (2026)

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

List Privacy Under Function Recoverability
by: Nageswaran, Ajaykrishnan, et al.
Published: (2023)

DoDo-Code: an Efficient Levenshtein Distance Embedding-based Code for 4-ary IDS Channel
by: Guo, Alan J. X., et al.
Published: (2023)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

Four classes of optimal p-ary cyclic codes
by: Fan, Jinmei, et al.
Published: (2025)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)