Coding theory and bilinear complexity/
Shokranian, Salahoddin, 1948-
Coding theory and bilinear complexity/ Salahoddin Shokranian, Mohammad Amin Shokrollahi. - Jülich [Germany]: Forschungzentrum Jülich, c1993. - iv, 82 p.; 24 cm. - Scientific Series of the International Bureau, v. 21 0938-7676; .
"German-Brasilian-Cooperation in Scientific Research and Technological Development."
Includes bibliographical references (p. 77-80) and index.
1. Linear codes -- 2. Algebraic function fields -- 3. Geometric Goppa codes -- 4. Codes above the Gilbert-Varshamov-Bound -- 5. Modular function fields -- 6. Space of cusp forms -- 7. Number of prime divisors of p-modular fields -- 8. Introduction to the theory of bilinear complexity -- 9. Bilinear complexity and codes -- 10. Multiplication in finite fields .
3893361235
Coding theory.
Computational complexity.
003.54 / S559c
Coding theory and bilinear complexity/ Salahoddin Shokranian, Mohammad Amin Shokrollahi. - Jülich [Germany]: Forschungzentrum Jülich, c1993. - iv, 82 p.; 24 cm. - Scientific Series of the International Bureau, v. 21 0938-7676; .
"German-Brasilian-Cooperation in Scientific Research and Technological Development."
Includes bibliographical references (p. 77-80) and index.
1. Linear codes -- 2. Algebraic function fields -- 3. Geometric Goppa codes -- 4. Codes above the Gilbert-Varshamov-Bound -- 5. Modular function fields -- 6. Space of cusp forms -- 7. Number of prime divisors of p-modular fields -- 8. Introduction to the theory of bilinear complexity -- 9. Bilinear complexity and codes -- 10. Multiplication in finite fields .
3893361235
Coding theory.
Computational complexity.
003.54 / S559c