For the construction of the generator polynomial g of a BCH module 6-code we can use the algorithm given in Section 4. The decoding ... Let C be a BCH module 6-code with the notations of definition (cf. |M) and q0 = 2. If the order of 3 is at least 2aquot; a 1 then C has a minimum distance at least 6. ... The following examples show that there are more BCH module 6-codes than BCH ideal 6- codes. EXAMPLE.

Title | : | Cryptography and Coding |

Author | : | Matthew G. Parker |

Publisher | : | Springer - 2009-12-02 |

Continue