We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.