Chain of Separable Binary Goppa Codes and their Minimal Distance

Simple item page
dc.creatorBezzateev, Sergey
dc.creatorShekhunova, Natalia
dc.date2007-07-27
dc.date.accessioned2026-07-07T08:20:43Z
dc.date.available2026-07-07T08:20:43Z
dc.descriptionIt is shown that subclasses of separable binary Goppa codes, $Γ(L,G)$ - codes, with $L=\{α\in GF(2^{2l}):G(α)\neq 0 \}$ and special Goppa polynomials G(x) can be presented as a chain of embedded codes. The true minimal distance has been obtained for all codes of the chain.
dc.description7 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0707.4083
dc.identifierhttp://arxiv.org/abs/0707.4083
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135147
dc.subjectInformation Theory
dc.subjectE.4.x
dc.titleChain of Separable Binary Goppa Codes and their Minimal Distance
dc.typetext

Files

Collections

arXiv