Isometry Classes of Indecomposable Linear Codes

next up previous
Next: Notation

Isometry Classes of Indecomposable Linear Codes



In the constructive theory of linear codes, we can restrict attention to the isometry classes of indecomposable codes, as it was shown by SLEPIAN. We describe these classes as orbits and we demonstrate how they can be enumerated using cycle index polynomials and the tools already incorporated in SYMMETRICA, a computer algebra package devoted to representation theory and combinatorics of symmetric groups and of related classes of groups. Moreover, we describe how systems of representatives of these classes can be evaluated using double coset methods.

Herr Fripertinger
Sun Feb 05 17:20:29 MET 1995