Gapplet
Construct a cyclic code in two steps.
| First input the length n, of the code |
||
Compute the factors of Xn-1 in
Z/2Z[X]
|
||
| Next input the number of the factor to be used for generating the code |
||
Describe the code obtained
Compare the BCH bound with the last parameter: the real minimal distance |
||