Projective geometries over larger fields are used to construct families of codes which improve significantly the upper bound for l (m,2) obtained by amalgamation of Hamming codes. General methods are ...

The generalized Hamming weight, d/sub r/(C), of a binary linear code C is the size of the smallest support of any r-dimensional subcode of C. The parameter d/sub r/(C) determines the code's ...