Computing Extensions of Linear Codes
classification
💻 cs.IT
cs.DMmath.IT
keywords
codeslineardistanceextensionsminimumaddingbeenbounds
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.