Skip to content

ableenk/codingtheory

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 

Repository files navigation

Coding theory utilities with python

At the moment you can find the minimum distance of cyclic code with length n and generating polynomial g(x).

Example 1

Exercise

Find the minimum distance of cyclic code with length 25 and generating polynomial g(x) = x^4 + x^3 + x^2 + x + 1.

Code

length = 25
generating_polynomial = 'x^4+x^3+x^2+x+1'
code_diameter, multiplier = ct.code_minimum_distance(generating_polynomial, length, log=True)

Printed Solution

cyclic code generating polynomial g(x) = x^4 + x^3 + x^2 + x + 1
cyclic code length = 25
code minimum distance d = 2 with multiplier m(x) = x + 1