[1] GYARMATI K.Character sums and polynomials,radon series on computation and applied mathematics:finite fields and their applications [M].Berlin:De Cruyter,2013.
[2] TOPUZOGLU A,WINTERHOF A.Pseudorandom sequences:topics in geometry,coding theory and cryptography[M].Algeba Applications:Springer,2007.
[3] AHLSWEDE R,KHACHATRIAN L H,MAUDUIT C,et al.A complexity measure for families of binary sequences [J].Periodica Math Hungar,2006,46(2):107-118.
[4] GYARMATI K,MAUDUIT C,SARKOZY A.Applied algebra and number theory:the cross correlation measure for families of binary sequences [M].Cambridge:Cambridge University Press,2014:126-143.
[5] MAUDUIT C,SARKOZY A.On finite pseudorandom binary sequences I: measure of pseudorandomness,the Legendre symbol [J].Acta Arithmetica,1997,82(4):365-377.
[6] GYARMATI K.On the complexity of a family related to the Legendre symbol [J].Periodica Math Hungar,2009,58(2):209-215.
[7] GYARMATI K.On the complexity of a family of Legendre sequences with irreducible polynomials [J].Finite Fields and their Applications,2015,33:175-186.
[8] WINTERHOF A,YAYLA O.Family complexity and cross-correlation measure for families of binary sequences [J].Ramanujan J,2016,39(3):639-645.
[9] YAYLA O.Families of sequences with good family complexity and cross-correlation measure [EB/OL].https://www.researchgate.net/publication/341040005,2020-04-29.
[10] WEIL A.Sur les courbes algébriques et les variétés qui s’en déduisentc [M].Paris:Hermann,1948.
[11] MORENO C J,MORENO O.Exponential sums and Goppa codes:I [J].Proceedings of the American Mathematical Society,1991,111(2):523-531.
[12] 刘华宁.数论中的伪随机二进制数列 [M].北京:科学出版社,2008.
[13] 潘承洞,潘承彪.解析数论基础 [M].北京:科学出版社,1999. |
