Plotkin construction: rank and kernel

Simple item page
dc.creatorBorges, Joaquim
dc.creatorFernandez, Cristina
dc.date2007-07-26
dc.date.accessioned2026-07-07T08:20:27Z
dc.date.available2026-07-07T08:20:27Z
dc.descriptionGiven two binary codes of length n, using Plotkin construction we obtain a code of length 2n. The construction works for linear and nonlinear codes. For the linear case, it is straightforward to see that the dimension of the final code is the sum of the dimensions of the starting codes. For nonlinear codes, the rank and the dimension of the kernel are standard mesures of linearity. In this report, we prove that both parameters are also the sum of the corresponding ones of the starting codes.
dc.identifierhttps://arxiv.org/abs/0707.3878
dc.identifierhttp://arxiv.org/abs/0707.3878
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135073
dc.subjectInformation Theory
dc.subject94B25 (Primary); 11T71 (Secondary)
dc.titlePlotkin construction: rank and kernel
dc.typetext

Files

Collections

arXiv