Quasi-twisted codes are generalizations of the familiar linear quasi-cyclic codes. In this
paper, an algebraic method is used to investigate the relationship between quasi-twisted …

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a
special place in algebraic coding theory. Among other things, many of the best-known or …

One of the most important and challenging problems in coding theory is to construct codes
with good parameters. There are various methods to construct codes with the best possible …

A fundamental problem in coding theory is the explicit construction of linear codes with best
possible parameters. A search algorithm (ASR) on certain types of quasi-twisted (QT) codes …

In this paper, we introduce a new class of linear codes over finite fields, viz. skew multi-
twisted codes (or skew generalized quasi-twisted codes), which is a generalization of some …

Explicit construction of linear codes with best possible parameters is one of the major
problems in coding theory. Among all alphabets of interest, the binary alphabet is the most …

Let F q denote the finite field of order q, let m 1, m 2,⋯, m ℓ be positive integers satisfying
gcd⁡(mi, q)= 1 for 1≤ i≤ ℓ, and let n= m 1+ m 2+⋯+ m ℓ. Let Λ=(λ 1, λ 2,⋯, λ ℓ) be fixed …

Cyclic codes are among the most important families of codes in coding theory for both
theoretical and practical reasons. Despite their prominence and intensive research on cyclic …

Let n,k,d_q code be a linear code of length n, dimension k and minimum Hamming distance
d over GF(q). One of the basic and most important problems in coding theory is to construct …

One of the main challenges of coding theory is to construct linear codes with the best
possible parameters. Various algebraic and combinatorial methods along with computer …