2000 character limit reached
Chain of Separable Binary Goppa Codes and their Minimal Distance
Published 27 Jul 2007 in cs.IT and math.IT | (0707.4083v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
