2000 character limit reached
Equivalence of Quasi-cyclic Codes over Finite Fields
Published 8 Jul 2016 in cs.IT and math.IT | (1607.07798v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.