Equivalence of Quasi-cyclic Codes over Finite Fields

TL;DR

This paper investigates the equivalence problem for quasi-cyclic codes over finite fields and uses the findings to construct isodual quasi-cyclic codes, contributing to coding theory.

Contribution

It introduces new methods to determine code equivalence and constructs isodual quasi-cyclic codes, advancing understanding of code symmetries.

Findings

Established criteria for code equivalence over finite fields

Constructed new classes of isodual quasi-cyclic codes

Enhanced methods for analyzing code symmetries

Abstract

This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.