A new algorithm for equivalence of cyclic codes and its applications

Cyclic codes are among the most important families of in coding theory for both theoretical and practical reasons. Despite their prominence intensive research on cyclic over a half century, there still open problems related to codes. In this work, we use recent results equivalence create more efficient algorithm partition by based cyclotomic cosets. This is then implemented carry out computer searches quasi-cyclic (QC) with good parameters. We also generalize these repeated-root cases. have found several new linear that or QC as an application approach, well desirable constructions best known With additional obtained through standard constructions, total 14