Generalized spectral bound for quasi-twisted codes

Minimum distance bounds play a central role in the analysis of algebraic codes. For cyclic and constacyclic codes, several bounds based on their zero set have been developed. However, analogous results for quasi-twisted (QT) codes are comparatively limited. In this paper, we further investigate the spectral theory of QT codes and derive a general spectral bound on their minimum distance. Our bound unifies and generalizes previously known spectral bounds for quasi-cyclic (QC) and QT codes, and contains them as special cases. We present a new proof technique and show that the bound can be formulated with respect to an arbitrary subset of eigenvalues, thereby extending its applicability to the largest possible setting. Numerical examples and simulations demonstrate that the proposed bound often improves upon the Jensen bound and earlier spectral bounds.

Authors

Publication Details

Journal
TURKISH JOURNAL OF MATHEMATICS
Published
2026-09-01
DOI
https://doi.org/10.55730/1300-0098.3770
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalized spectral bound for quasi-twisted codes

Buket Özkaya
TURKISH JOURNAL OF MATHEMATICS
Coding theory and cryptography
article

Generalized spectral bound for quasi-twisted codes

Buket Özkaya
article en

Abstract

Minimum distance bounds play a central role in the analysis of algebraic codes. For cyclic and constacyclic codes, several bounds based on their zero set have been developed. However, analogous results for quasi-twisted (QT) codes are comparatively limited. In this paper, we further investigate the spectral theory of QT codes and derive a general spectral bound on their minimum distance. Our bound unifies and generalizes previously known spectral bounds for quasi-cyclic (QC) and QT codes, and contains them as special cases. We present a new proof technique and show that the bound can be formulated with respect to an arbitrary subset of eigenvalues, thereby extending its applicability to the largest possible setting. Numerical examples and simulations demonstrate that the proposed bound often improves upon the Jensen bound and earlier spectral bounds.

TURKISH JOURNAL OF MATHEMATICSVol. 50(5)
Openalex Percentile: Top 98%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.