Chain of Separable Binary Goppa Codes and their Minimal Distance
Abstract
It is shown that subclasses of separable binary Goppa codes, (L,G) - codes, with L=\α ∈ GF(22l):G(α)≠ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.