A solution of an equivalence problem for semisimple cyclic codes

2011/05/22 by M. Muzychuk, Muzychuk, M.
Mathematics · #11T71 #20B25 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #math.CO #math.GR #msc:11T71 #msc:20B25

paper · pdf · doi:10.48550/arxiv.1105.4320

arxiv created 2011/05/22 · arxiv updated 2011/05/24

Abstract

In this paper we propose an efficient solution of an equivalence problem for semisimple cyclic codes.

Related

• A New Algorithm for Equivalence of Cyclic Codes and Its Applications
• A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes
• Equivalence of Quasi-cyclic Codes over Finite Fields
• Cyclic Codes from Cyclotomic Sequences of Order Four
• Reducible Cyclic Codes Constructed as the Direct Sum of Two Semiprimitive Cyclic Codes