Equivalence of Quasi-cyclic Codes over Finite Fields
classification
💻 cs.IT
math.IT
keywords
codesquasi-cyclicequivalencefieldsfiniteconsidersconstructisodual
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.