Chain of Separable Binary Goppa Codes and their Minimal Distance
classification
💻 cs.IT
math.IT
keywords
codeschaingoppaalphabinarydistanceminimalseparable
read the original abstract
It is shown that subclasses of separable binary Goppa codes, $\Gamma(L,G)$ - codes, with $L=\{\alpha \in GF(2^{2l}):G(\alpha)\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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.