At the moment you can find the minimum distance of cyclic code with length n and generating polynomial g(x).
Find the minimum distance of cyclic code with length 25 and generating polynomial g(x) = x^4 + x^3 + x^2 + x + 1.
length = 25
generating_polynomial = 'x^4+x^3+x^2+x+1'
code_diameter, multiplier = ct.code_minimum_distance(generating_polynomial, length, log=True)
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