The well-known Tsfasman-Vladut-Zink (TVZ) theorem states that for all prime powers q = 2 ≥ 49 there exist sequences of linear codes over Fq with increasing.
The basic ingredients in the proof of the TVZ theorem are sequences of modular curves (or their corresponding function fields) having many rational points in ...
Nice codes from nice curves · Contents. AAECC'07: Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting ...
The well-known Tsfasman-Vladut-Zink (TVZ) theorem states that for all prime powers q = l 2 ≥ 49 there exist sequences of linear codes over ...
Bibliographic details on Nice Codes from Nice Curves.
The goal of this course is to introduce you to some of the basics of coding theory, algebraic geometry, and algebraic geometric codes. Before we write down a ...
The source code of this repository correspond to the work Security and Efficiency Trade-offs for Elliptic Curve Diffie-Hellman at the 128-bit and 224-bit ...
In this work, we study elliptic curves of the form E L : y 2 = x ( x − 1 ) ( x − L ) , where L 2 − L + 1 ∈ ( Q × ) 2 and L ∈ Q ∖ { 0 , 1 } .
The NICE Workforce Framework for Cybersecurity (NICE Framework) has existed in one form or another for nearly 20 years. During this time, it has evolved and ...
Missing: Curves. | Show results with:Curves.
Anyone know any? I can find linear ones but I want adjustable curves. Thanks.