A solution of an equivalence problem for semisimple cyclic codes

DOI10.1090/conm/632/12636zbMath1419.94074arXiv1105.4320OpenAlexW70927508MaRDI QIDQ3187299

Mikhail E. 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

cyclic codescode equivalence problem

Mathematics Subject Classification ID

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

Related Items (3)

Monomial isomorphisms of cyclic codes ⋮ Testing isomorphism of circulant objects in polynomial time ⋮ On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes

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