A solution of an equivalence problem for semisimple cyclic codes

DOI10.1090/CONM/632/12636MaRDI QIDQ3187299zbMATH OpenOpenAlexFDO

Authors Mikhail Muzychuk

Publication date 2 September 2016

Published in Topics in Finite Fields (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.4320

zbMATH Keywords

code equivalence problemcyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Cyclic codes (94B15)

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

Recommendations

• On the equivalence of cyclic and quasi-cyclic codes over finite fields
• Is code equivalence easy to decide?
• Inequivalent cyclic codes of prime length (Corresp.)
• About the code equivalence
• scientific article; zbMATH DE number 3871185

Cited in

(10)

• Testing isomorphism of circulant objects in polynomial time
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
• scientific article; zbMATH DE number 3871185 (Why is no real title available?)
• Is code equivalence easy to decide?
• Monomial isomorphisms of cyclic codes
• On the equivalence of cyclic and quasi-cyclic codes over finite fields
• About the code equivalence
• scientific article; zbMATH DE number 3246818 (Why is no real title available?)
• A new algorithm for equivalence of cyclic codes and its applications
• Testing isomorphism of circulant objects in polynomial time

This page was built for publication: A solution of an equivalence problem for semisimple cyclic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187299)