On the dimension of Goppa codes
From MaRDI portal
The author considers subfield subcodes of algebraic geometry codes. \textit{M. Wirtz} [IEEE Trans. Inform. Theory IT-34, Part II, 1341-1343 (1989; Zbl 0665.94013)] has given a lower bound on the dimension of such codes. In the present paper it is proved that this bound is exact for a sufficiently small divisor. In the proof, the Riemann-Roch theorem and a generalization of the Carlitz-Uchiyama bound due to \textit{G. Lachaud} [J. Number Theory 39, No. 1, 18-40 (1991; Zbl 0741.11048)] play an important role.
Recommendations
Cites work
Cited in
(14)- The parameters of subcodes of algebraic-geometric codes over prime subfields
- On the dimension of the subfield subcodes of 1-point Hermitian codes
- Proof of conjectures on the true dimension of some binary Goppa codes
- On the dimension and structure of the square of the dual of a Goppa code
- The true dimension of certain binary Goppa codes
- On Elliptic Convolutional Goppa Codes
- On the parameters of Goppa codes
- The trace operator and redundancy of Goppa codes
- Massey’s Theorem and the Golay Codes
- scientific article; zbMATH DE number 5252301 (Why is no real title available?)
- Note on the dimension of Goppa codes
- On the dimension of an APN code
- Convolutional Goppa codes defined on fibrations
- On quaternary Goppa codes
This page was built for publication: On the dimension of Goppa codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205124)