Abstract
We survey some recent constructions of linear codes and almost perfect sequences based on algebraic curves over finite fields.
Research supported by the NUS grant RP3991621
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G.-L. Feng and T.R.N. Rao, Improved geometric Goppa codes. Part I: Basic theory, IEEE Trans. Inform. Theory 41, 1678–1693 (1995).
V.D. Goppa, Codes on algebraic curves (Russian), Dokl. Akad. Nauk SSSR 259, 1289–1290 (1981).
N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48, 203–209 (1987).
D. Kohel, S. Ling, and CP. Xing, Explicit sequence expansions, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 308–317, Springer, London, 1999.
H.W. Lenstra Jr., Factoring integers with elhptic curves, Ann. Math. 126, 649–673 (1987).
H. Niederreiter, Continued fractions for formal power series, pseudorandom numbers, and linear complexity of sequences, Contributions to General Algebra 5 (Proc. Salzburg Conf., 1986), pp. 221–233, Teubner, Stuttgart, 1987.
H. Niederreiter, Sequences with almost perfect linear complexity profile, Advances in Cryptology — EUROCRYPT ′87 (D. Chaum and W.L. Price, eds.), Lecture Notes in Computer Science, Vol. 304, pp. 37–51, Springer, Berlin, 1988.
H. Niederreiter, The probabilistic theory of linear complexity, Advances in Cryptology — EUROCRYPT ′88 (CG. Günther, ed.), Lecture Notes in Computer Science, Vol. 330, pp. 191–209, Springer, Berlin, 1988.
H. Niederreiter, Key stream sequences with a good linear complexity profile for every starting point. Advances in Cryptology — EUROCRYPT ′89 (J.-J. Quisquater and J. Vandewalle, eds.). Lecture Notes in Computer Science, Vol. 434, pp. 523–532, Springer, Berlin, 1990.
H. Niederreiter, Finite fields and cryptology, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds.), pp. 359–373, Dekker, New York, 1993.
H. Niederreiter, Some computable complexity measures for binary sequences. Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 67–78, Springer, London, 1999.
H. Niederreiter and M. Vielhaber, Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles, J. Complexity 13, 353–383 (1997).
H. Niederreiter and CP. Xing, Quasirandom points and global function fields, Finite Fields and Applications (S. D. Cohen and H. Niederreiter, eds.), London Math. Soc. Lecture Note Series, Vol. 233, pp. 269–296, Cambridge University Press, Cambridge, 1996.
H. Niederreiter and CP. Xing, Low-discrepancy sequences and global function fields with many rational places. Finite Fields Appl. 2, 241–273 (1996).
H. Niederreiter and CP. Xing, Towers of global function fields with asymptotically many rational places and an improvement on the Gilbert-Varshamov bound, Math. Nachr. 195, 171–186 (1998).
H. Niederreiter, CP. Xing, and K.Y. Lam, A new construction of algebraicgeometry codes, Appl. Algebra Engrg. Comm. Comput. 9, 373–381 (1999).
F. Özbudak and H. Stichtenoth, Constructing codes from algebraic curves, IEEE Trans. Inform. Theory 45, 2502–2505 (1999).
R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.
R.A. Rueppel, Stream ciphers, Contemporary Cryptology: The Science of Information Integrity (G.J. Simmons, ed.), pp. 65–134, IEEE Press, New York, 1992.
H. Stichtenoth, Algebraic Function Fields and Codes, Springer, Berlin, 1993.
M.A. Tsfasman and S.G. Vlădut, Algebraic-Geometric Codes, Kluwer, Dordrecht, 1991.
M.A. Tsfasman, S.G. Vlădut, and T. Zink, Modular curves, Shimura curves, and Goppa codes, better than Varshamov — Gilbert bound, Math. Nachr. 109, 21–28 (1982).
C.P. Xing and K.Y. Lam, Sequences with almost perfect linear complexity profiles and curves over finite fields, IEEE Trans. Inform. Theory 45, 1267–1270 (1999).
C.P. Xing and S. Ling, A class of linear codes with good parameters, preprint, 1999.
C.P. Xing and S. Ling, A class of hnear codes with good parameters from algebraic curves, IEEE Trans. Inform. Theory, to appear.
C.P. Xing, H. Niederreiter, and K.Y. Lam, Constructions of algebraic-geometry codes, IEEE Trans. Inform. Theory 45, 1186–1193 (1999).
CP. Xing, H. Niederreiter, and K.Y. Lam, A generahzation of algebraic-geometry codes, IEEE Trans. Inform. Theory 45, 2498–2501 (1999).
CP. Xing, H. Niederreiter, K.Y. Lam, and CS. Ding, Constructions of sequences with almost perfect linear complexity profile from curves over finite fields. Finite Fields Appl. 5, 301–313 (1999).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xing, C., Niederreiter, H. (2001). Applications of Algebraic Curves to Constructions of Codes and Almost Perfect Sequences. In: Jungnickel, D., Niederreiter, H. (eds) Finite Fields and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56755-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-56755-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62498-8
Online ISBN: 978-3-642-56755-1
eBook Packages: Springer Book Archive