NUMBER OF DIFFERENT CYCLIC CODES OF SPECIFIED LENGTH

  • Svetlana Yurievna Korabelshchikova
  • Alexey Igorevich Chesnokov

Abstract

We consider the problem of determining the number of cyclic codes over a finite field with arbitrary fixed parameters n – length of the code, and k – the number of data symbols. An algorithm of solution of this problem is given for the general case. There are theoretical justification of the algorithm, the program code in C ++, as well as results of the program for some fixed values.
Section
Technical Sciences