Alternant codes

From MaRDI portal





Starting from the observation that an \((n,k)\) code over \(\mathrm{GF}(q)\) can be described by a \((t\times n)\) parity check matrix over \(\mathrm{GF}(q^m)\) (with \(mt\ge n - k)\), the author considers alternant codes, those whose parity check matrix has \((i,j)\) entry \(y_ig_j(x_i)\), where \(y_i\ne 0\), the \(x_i\) are distinct, and \(g_1,\ldots,g_t\) are polynomials of degree \(t-1\) such that their matrix of coefficients is nonsingular. This class includes the BCH, Srivastava, and Goppa codes [\textit{V. D. Goppa}, Probl. Peredaci Inform. 6, No. 3, 24--30 (1970; Zbl 0292.94011); 7, No. 3, 41--49 (1971; Zbl 0306.94010)], and it asymptotically meets the Varshamov-Gilbert bound. The paper then considers the special case with parity check matrix \[ H= \begin{bmatrix} H_1 \\ \vdots \\ H_s \end{bmatrix}, \quad (H_l)_{ij} = \frac{z_i}{(x_i - w_i)^j}, \ l= 1,\ldots,s, \] where \(t=rs\), \(1\le i\le r\), \(1\le j\le n\). (These are modifications of Goppa codes.) If \(\mathrm{GF}(q^n)\) has a proper subfield \(\mathrm{GF}(q^\lambda)\), and \(m= \lambda s\), \(z_i\in \mathrm{GF}(q^\lambda) - \{0\}\), \(w_j = w^{q^{\lambda(j-1)}}\) \((j = 1,\ldots,s)\), the codes are called nonprimitive. Discussion and tables of the minimum distance of nonprimitive alternant codes and their duals are given.











This page was built for publication: Alternant codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071141)