Optimum Linear Codes with Support Constraints over Small Fields

The problem of designing a linear code with the largest possible minimum distance, subject to support constraints on the generator matrix, has recently found several applications. These include multiple access networks [3], [5] as well as weakly secure data exchange [4], [8]. A simple upper bound on the maximum minimum distance can be obtained from a sequence of Singleton bounds (see (3) below) and can further be achieved by randomly choosing the nonzero elements of the generator matrix from a field of a large enough size