Cover Image

Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Chao, Chen, Hao, Ji, Qinqin, Xie, Ziyan, Zheng, Dabin, Xia, Yongbo
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes
by: Chen, Hao
Published: (2024)

Cyclic and Negacyclic Sum-Rank Codes
by: Chen, Hao, et al.
Published: (2024)

Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes
by: Chen, Hao, et al.
Published: (2023)

Concatenated Sum-Rank Codes
by: Lao, Huimin, et al.
Published: (2026)

The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields
by: Zhu, Li, et al.
Published: (2026)

Self-Dual Cyclic Codes with Square-Root-Like Lower Bounds on Their Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

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

Maximum Sum-Rank Distance Codes over Finite Chain Rings
by: Martínez-Peñas, Umberto, et al.
Published: (2021)

Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding
by: Yao, Yuhang, et al.
Published: (2026)

A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
by: Zheng, Xiongkun, et al.
Published: (2026)

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

Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions
by: Yunlong, Zhu, et al.
Published: (2025)

Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
by: Wang, Yurui, et al.
Published: (2026)

Two-Step Decoding of Binary $2\times2$ Sum-Rank-Metric Codes
by: Wu, Hao, et al.
Published: (2025)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

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

Weighted-Hamming Metric: Bounds and Codes
by: Bitzer, Sebastian, et al.
Published: (2026)

On the Minimum Distances of Some Families of Goppa Codes and BCH Codes
by: Chen, Yaqi, et al.
Published: (2026)

$r$-Minimal Codes with Respect to Rank Metric
by: Xu, Yang, et al.
Published: (2024)

Generalized Spectral Bound for Quasi-Twisted Codes
by: Özkaya, Buket
Published: (2025)

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

Optimal Rank-Metric Codes with Rank-Locality from Drinfeld Modules
by: Bastioni, Luca, et al.
Published: (2024)

Upper Bounds on the Minimum Distance of Structured LDPC Codes
by: Arnault, François, et al.
Published: (2025)

On the Minimum Distances of Some Families of BCH Codes
by: Chen, Yaqi, et al.
Published: (2026)

Bounded-degree Low Rank Parity Check Codes
by: Franch, Ermes, et al.
Published: (2024)

On Nearly Perfect Covering Codes
by: Boruchovsky, Avital, et al.
Published: (2024)

Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known
by: Chen, Hao, et al.
Published: (2024)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
by: Cotardo, Giuseppe, et al.
Published: (2024)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

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

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

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric
by: Sun, Yubo, et al.
Published: (2024)

Griesmer Bound and Constructions of Linear Codes in $b$-Symbol Metric
by: Luo, Gaojun, et al.
Published: (2024)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
by: Shi, Haoming, et al.
Published: (2025)

Support-Guessing Decoding Algorithms in the Sum-Rank Metric
by: Jerkovits, Thomas, 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)

Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
by: Peng, Qingqing, et al.
Published: (2025)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)