This article is cited in 2 papers

Coding Theory

Special classes of separable Goppa codes with improved parameter estimates

S. V. Bezzateev, N. A. Shekhunova

Saint-Petersburg State University of Aerospace Instrumentation

Abstract: We show that subclasses of $q$-ary separable Goppa codes $\Gamma(L,G)$ with $L=\{ \alpha\in GF(q^{2\ell})\colon G(\alpha)\ne0\}$ 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.

UDC: 621.391.15+519.7

Received: 04.12.2009
Revised: 11.05.2010

 English version: Problems of Information Transmission, 2010, 46:3, 225–244

Bibliographic databases:

• 
• 
•