Special classes of separable Goppa codes with improved parameter estimates
Sergey Valentinovich Bezzateev, Natalia A. Shekhunova · Problems of Information Transmission · 2010
We show that subclasses of q-ary separable Goppa codes Γ(L, G) with L = {α ∈ GF(q 2ℓ): G(α) ∈ 0} and with special Goppa polynomials G(x) can be represented as a chain of equivalent and embedded codes. For all codes of the chain we obtain an improved bound for the dimension and find an exact value of the minimum distance. A chain of binary codes is considered as a particular case with specific properties.