2000 character limit reached
Sixteen New Linear Codes With Plotkin Sum (0804.3507v1)
Published 22 Apr 2008 in cs.IT and math.IT
Abstract: Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are constructed using the Plotkin sum of two linear codes, also called $(u|u+v)$ construction. The computations have been achieved using an exhaustiv search.