Crosscorrelation of m-Sequences, Exponential Sums and Dickson Polynomials

スポンサーリンク

概要

• 論文の詳細を見る

• Binary maximal-length sequences (or m-sequences) are sequences of period 2m-1 generated by a linear recursion of degree m. Decimating an m-sequence {st} by an integer d relatively prime to 2m-1 leads to another m-sequence {sdt} of the same period. The crosscorrelation of m-sequences has many applications in communication systems and has been an important and well studied problem during more than 40 years. This paper presents an updated survey on the crosscorrelation between binary m-sequences with at most five-valued crosscorrelation and shows some of the many recent connections of this problem to several areas of mathematics such as exponential sums and Dickson polynomials.

• （社）電子情報通信学会の論文
• 2010-11-01

著者

• HELLESETH Tor

  Selmer Center, Department of Informatics, University of Bergen

• Helleseth Tor

  Selmer Center Department Of Informatics University Of Bergen

関連論文

• Crosscorrelation of m-Sequences, Exponential Sums and Dickson Polynomials
• Crosscorrelation of m-Sequences, Exponential Sums and Dickson Polynomials

スポンサーリンク