Enumeration, construction and random generation of block codes (Q1265228): Difference between revisions

Methods are presented for the enumeration, construction and random generation of block codes. The approach taken is via the isometry classes of block codes and uses methods from algebraic combinatorics. As discrete structures, the equivalence classes can be classified using combinatorial and algebraic methods. The number of classes is enumerated for small alphabets and small code parameters using Polya's Theorem. The computer algebra system SYMMETRICA is used to obtain these results. Complete lists of representatives can be computed when the number of classes is small. For large class sizes, the Dixon-Wilf algorithm can be applied to generate block codes uniformly at random. In this way unprejudiced lists of representatives are derived which can be used to check hypotheses.