On a Kronecker products sum distance bounds

Simple item page
dc.creatorGrigoryants, Armen
dc.date2005-03-17
dc.date.accessioned2026-07-07T08:15:23Z
dc.date.available2026-07-07T08:15:23Z
dc.descriptionA binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bounds is allocated.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/cs/0503038
dc.identifierhttp://arxiv.org/abs/cs/0503038
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133431
dc.subjectInformation Theory
dc.titleOn a Kronecker products sum distance bounds
dc.typetext

Files

Collections

arXiv