Sixteen New Linear Codes With Plotkin Sum

Simple item page
dc.creatorHernando, Fernando
dc.creatorRuano, Diego
dc.date2008-04-22
dc.date.accessioned2026-07-07T09:34:01Z
dc.date.available2026-07-07T09:34:01Z
dc.descriptionSixteen 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.
dc.descriptionSubmitted to IEEE Trans. Information Theory
dc.identifierhttps://arxiv.org/abs/0804.3507
dc.identifierhttp://arxiv.org/abs/0804.3507
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159338
dc.subjectInformation Theory
dc.titleSixteen New Linear Codes With Plotkin Sum
dc.typetext

Files

Collections

arXiv