Chain of Separable Binary Goppa Codes and Their Minimal Distance
Sergey Valentinovich Bezzateev, Natalia A. Shekhunova · IEEE Transactions on Information Theory · 2008
It is shown that subclasses of separable binary Goppa codes,Gamma(L,G) - codes, withL={alpha isin GF(22l):G(alpha) ne 0 } and special Goppa polynomialsG(x) can be presented as a chain of embedded and equivalent codes. The true minimal distance has been obtained for all codes of the chain.