Coding Theory and Bilinear Complexity

The book gives an easy introduction into the theory of algebraic curves over finite fields to the extent necessary for the basic definitions of the theory of codes from algebraic geometry. Afterwards, it introduces the notion of bilinear complexity, and goes on to design bilinear algorithms for multiplication in finite fields using algebraic curves over finite fields.


Year:
1993
Publisher:
Juelich, International Office of the Forschungszentrum Juelich
ISBN:
3-89336-123-5
Keywords:
Laboratories:




 Record created 2007-01-24, last modified 2018-12-03


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)