Cover Image

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xiong, Yanzhen, Lu, Jianbing
Format:	Preprint
Published:	2026
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Geometric construction of k-optimal locally repairable codes
by: Fu, Yi, et al.
Published: (2026)

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

Near optimal constructions of frameproof codes
by: Liu, Miao, et al.
Published: (2024)

Explicit constructions of optimal blocking sets and minimal codes
by: Bishnoi, Anurag, et al.
Published: (2024)

On the minimum Hamming distance between vectorial Boolean and affine functions
by: Nagy, Gabor P.
Published: (2025)

On the size of maximal binary codes with 2, 3, and 4 distances
by: Barg, Alexander, et al.
Published: (2022)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Explicit optimal-length locally repairable codes of distance 5
by: Beemer, Allison, et al.
Published: (2018)

Trellis codes with a good distance profile constructed from expander graphs
by: Zhu, Yubin, et al.
Published: (2026)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)

Using multi-orbit cyclic subspace codes for constructing optical orthogonal codes
by: Ozbudak, Ferruh, et al.
Published: (2024)

On low-power error-correcting cooling codes with large distances
by: Zhao, Yuhao, et al.
Published: (2024)

Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)

Quasi-optimal cyclic orbit codes
by: Castello, Chiara, et al.
Published: (2025)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

Asymptotic construction of locally repairable codes with multiple recovering sets
by: Li, Singsong, et al.
Published: (2024)

The minimum distance of the antiprimitive BCH code with designed distance 3
by: Xu, Haojie, et al.
Published: (2025)

Approximate generalized Steiner systems and near-optimal constant weight codes
by: Liu, Miao, et al.
Published: (2024)

Edge inducibility via local directed graphs
by: Chao, Ting-Wei, et al.
Published: (2025)

Quotients of skew polynomial rings: new constructions of division algebras and MRD codes
by: Lobillo, F. J., et al.
Published: (2025)

On the largest minimum distances of [n,6] LCD codes
by: Liu, Yang, et al.
Published: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Additive codes from linear codes
by: Ball, Simeon, et al.
Published: (2025)

Constructions of locally repairable codes via concatenated codes
by: Jin, Hengfeng, et al.
Published: (2026)

Codes with restricted overlaps: expandability, constructions, and bounds
by: Stanovnik, Lidija
Published: (2024)

A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes
by: Harada, Masaaki
Published: (2024)

Easy repair via codes with simplex locality
by: Kuijper, Margreta, et al.
Published: (2025)

On one-orbit cyclic subspace codes of $\mathcal{G}_q(n,3)$
by: Castello, Chiara, et al.
Published: (2024)

Latroids and code invariants
by: Gorla, Elisa, et al.
Published: (2025)

Bounds on the minimum distance of locally recoverable codes
by: Kurz, Sascha
Published: (2023)

Error-detecting solid codes
by: Carruth, Nathan Thomas
Published: (2026)

On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
by: Stanovnik, Lidija, et al.
Published: (2024)

Improved bounds and optimal constructions of pure quantum locally recoverable codes
by: Li, Yang, et al.
Published: (2025)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

Focal-free uniform hypergraphs and codes
by: Huang, Xinqi, et al.
Published: (2024)

On perfect symmetric rank-metric codes
by: Mushrraf, Usman, et al.
Published: (2024)

Two-weight rank-metric codes
by: Zullo, Ferdinando, et al.
Published: (2024)

Optimal codes and arcs for the generalized Hamming weights
by: Kurz, Sascha, et al.
Published: (2026)

On the existence of linear rank-metric intersecting codes
by: Borello, Martino, et al.
Published: (2026)