Sixteen New Linear Codes With Plotkin Sum
classification
💻 cs.IT
math.IT
keywords
codeslinearboundsconstructiondistancelowerminimumplotkin
read the original 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.
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.