A Comparison of Distance Bounds for Quasi-Twisted Codes

Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the corresponding eigenspaces. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a way similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes. The eigencodes of a quasi-twisted code in the spectral theory and the outer codes in its concatenated structure are related. A comparison based on this relation verifies that the Jensen bound always outperforms the spectral bound under special conditions, which yields a similar relation between the Lally and the spectral bounds. The performances of the Lally, Jensen and spectral bounds are presented in comparison with each other.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2019

Spectral Bounds for Quasi-Twisted Codes

New lower bounds on the minimum distance of quasi-twisted codes over fin...
research
07/30/2020

Quasi-Cyclic Codes

Quasi-cyclic codes form an important class of algebraic codes that inclu...
research
03/24/2020

Dihedral codes with prescribed minimum distance

Dihedral codes, particular cases of quasi-cyclic codes, have a nice alge...
research
07/03/2018

The Concatenated Structure of Quasi-Abelian Codes

The decomposition of a quasi-abelian code into shorter linear codes over...
research
02/21/2022

On Grid Codes

If A_i is finite alphabet for i=1,...,n, the Manhattan distance is defin...
research
04/03/2021

Improving the Gilbert-Varshamov Bound by Graph Spectral Method

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert gra...
research
08/09/2019

Extending the Davis-Kahan theorem for comparing eigenvectors of two symmetric matrices II: Computation and Applications

The extended Davis-Kahan theorem makes use of polynomial matrix transfor...

Please sign up or login with your details

Forgot password? Click here to reset