Enumeration, construction and random generation of block codes
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.
- Derandomized construction of combinatorial batch codes
- Enumerable multitrack (d, k) block codes
- scientific article; zbMATH DE number 7560557
- Constructions of block codes from algebraic curves over finite fields
- scientific article; zbMATH DE number 1500506
- scientific article; zbMATH DE number 1047011
- On the trellis structure of block codes
- Random construction of partial MDS codes
- Some randomized code constructions from group actions
- Generalized block inserting for constructing new constant dimension codes
- Block codes for Bernoulli shifts
- Random generation of linear codes.
- Iteration Theory: Dynamical Systems and Functional Equations
- Randomized generation of error control codes with automata and transducers
- Isometry classes of codes arising from sets of points in the projective plane
- Combinatorial families enumerated by quasi-polynomials
This page was built for publication: Enumeration, construction and random generation of block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265228)
