Computing Extensions of Linear Codes

This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the previously known lower bounds on the minimum distance have been found.

💡 Research Summary

The paper addresses the longstanding problem of improving the minimum distance of a linear code by appending additional columns to its generator matrix—a process the authors refer to as “code extension.” The minimum distance d of a code directly determines its error‑correction capability, and many classical families (BCH, Reed–Solomon, Goppa, etc.) have well‑known bounds that are often not tight. By extending a code from parameters