Top
Back: sysCRHT
Forward: sysNewton
FastBack: brnoeth_lib
FastForward: System and Control theory
Up: decodegb_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.10.2.2 sysCRHTMindist

Procedure from library decodegb.lib (see decodegb_lib).

Usage:
sysCRHTMindist(n,defset,w); n,w are int, defset is list of int's
 
        - n length of the cyclic code,
        - defset is a list representing the defining set,
        - w is a candidate for the minimum distance

Return:
the ring to work with the Sala's ideal for the minimum distance containing the ideal with name 'crht_md'

Theory:
Based on 'defset' of the given cyclic code, the procedure constructs the corresponding Cooper-Reed-Heleseth-Truong ideal 'crht_md'. With its help one can find minimum distance of the code in the binary case. For basics of the method Cooper philosophy.

Example:
 


Top Back: sysCRHT Forward: sysNewton FastBack: brnoeth_lib FastForward: System and Control theory Up: decodegb_lib Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-6, Dec 2012, generated by texi2html.