Sixteen New Linear Codes With Plotkin Sum
Information Theory
2008-04-23 v1 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 construction. The computations have been achieved using an exhaustiv search.
Cite
@article{arxiv.0804.3507,
title = {Sixteen New Linear Codes With Plotkin Sum},
author = {Fernando Hernando and Diego Ruano},
journal= {arXiv preprint arXiv:0804.3507},
year = {2008}
}
Comments
Submitted to IEEE Trans. Information Theory