Chain of Separable Binary Goppa Codes and Their Minimal Distance

From MaRDI portal
Publication:3604913




Abstract: It is shown that subclasses of separable binary Goppa codes, Gamma(L,G) - codes, with L=alphainGF(22l):G(alpha)eq0 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.









This page was built for publication: Chain of Separable Binary Goppa Codes and Their Minimal Distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604913)