2000 character limit reached
Computing Extensions of Linear Codes
Published 19 Apr 2007 in cs.IT, cs.DM, and math.IT | (0704.2596v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.