… -Muller codes, and ovoid codes. Eleven families of optimal shortened codes over finite fields
… 2-designs are also constructed from some of the shortened codes presented in this paper. …

… Abstract—In this paper, we construct four families of linear codes over finite fields from the
… families of optimal linear codes, including infinite families of (near) Griesmer codes. We also …

… For example, puncturing and shortening C on a set of coordinate positions are two ways for
… of the extended codes of several infinite families of linear codes over finite fields. We present …

… -Muller codes have been an object of intensive study in coding … binary shortened codes of
two families of linear codes from … . studied some shortened linear codes over finite fields in [32]…

… of optimal linear codes over small fields with locality properties … determined by the properties
of a shortened first-order Reed– … the finite field of order q and Fq[X] the polynomial ring over …

… Furthermore, we discuss simpler constructions for linear codes. Before exploring these … If
we delete one coordinate in all codewords of a classical code, then we obtain a shorter code …

… in finite geometries, such as Euclidean geometries and projective geometries over finite
fields… Two multistep majority-logic decoding algorithms are devised for decoding these codes. …

… finite extensions of fields and optimal linear codes. First of all we improve on the lower bounds
on mmc over finite fields. … In order to obtain sharper bounds linear codes are shortened. (A …

… LCD codes over small finite fields by modifying some typical methods for constructing linear
codes. … from old ones, for example, the puncturing and shortening techniques, as well as the …

… Standard array decoding of linear codes … of topics over finite fields. These topics include
relations between the integers and polynomials over finite fields, matrices over finite fields, linear …