A solution of an equivalence problem for semisimple cyclic codes

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

3 Scopus citations

Abstract

In this paper a solution of an equivalence problem for semisimple cyclic codes is proposed. It is shown that this problem may be reduced tp an isomorphism problem of circulant colored digraphs. Using the solution of the isomoprhism problem for circulant graphs we obtain an algorithm for code equivalence testing which is polynomial in the code length provided that any field operation requires constant time.

Original languageEnglish
Title of host publicationContemporary Mathematics
PublisherAmerican Mathematical Society
Pages327-334
Number of pages8
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes

Publication series

NameContemporary Mathematics
Volume632
ISSN (Print)0271-4132
ISSN (Electronic)1098-3627

Keywords

  • Code equivalence problem
  • Cyclic codes

Fingerprint

Dive into the research topics of 'A solution of an equivalence problem for semisimple cyclic codes'. Together they form a unique fingerprint.

Cite this