Spectral Bounds for Quasi-Twisted Codes

New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a manner similar to how the Roos and shift bounds extend the BCH and HT bounds for cyclic codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/18/2020

A Comparison of Distance Bounds for Quasi-Twisted Codes

Spectral bounds on the minimum distance of quasi-twisted codes over fini...
research
04/03/2019

Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration

In recent years, several branch-and-bound (BnB) algorithms have been pro...
research
03/24/2020

Dihedral codes with prescribed minimum distance

Dihedral codes, particular cases of quasi-cyclic codes, have a nice alge...
research
12/19/2017

Quasi-Cyclic Constructions of Quantum Codes

We give sufficient conditions for self-orthogonality with respect to sym...
research
08/18/2021

Improved Lower Bounds for Secure Codes and Related Structures

Secure codes are widely-studied combinatorial structures which were intr...
research
10/06/2021

Computational lower bounds of the Maxwell eigenvalues

A method to compute guaranteed lower bounds to the eigenvalues of the Ma...
research
08/28/2018

Random Matrices from Linear Codes and Wigner's semicircle law

In this paper we consider a new normalization of matrices obtained by ch...

Please sign up or login with your details

Forgot password? Click here to reset