Titlebook: Sequences and their Applications; Proceedings of SETA C. Ding,T. Helleseth,H. Niederreiter Conference proceedings 1999 Springer-Verlag Lon

大漩渦

On Ideal Autocorrelation Sequences Arising from Hyperovals,rise to binary sequences with ideal autocorrelation function. An overview of this result is provided as well as a derivation of the trace expansion and linear span of sequences relating to the Segre hyperoval.

Myocyte

Correlation of ,-Sequences and Related Topics,ct (PN) and almost perfect (APN) nonlinear power mappings which are of interest in differential cryptanalysis. Further, we give connections to difference sets, sequences with two-level ideal auto-correlation and families of sequences with optimal correlation properties, as well as to hyperovals and permutation polynomials.

sulcus

Some Computable Complexity Measures for Binary Sequences,per will focus on complexity measures that are not only of theoretical interest, but that can also be obtained in an algorithmic manner, such as the linear complexity, the linear complexity profile, and the tree complexity. A survey of such complexity measures will be given, with an emphasis on recent results.

Cumbersome

Complementary Interpolants and a Welch-Berlekamp-style Algorithm,another algorithm which uses a more succinct formula for computing complementary interpolants. Both these algorithms can be used to solve the Welch-Berlekamp key equation and with simple modifications using the approach of [., .], may also be used to compute the linear complexity profile of a sequence.

原來

Regular Cosets and Upper Bounds on the Linear Complexity of Certain Sequences,n Key’s upper bound and allow to deduce a simple recommendation for the design of secure filter generators. As a tool, a new class of cyclotomic cosets whose degeneration is relatively easy to prove in specific conditions is introduced and analysed.

dominant

Automaticity of Solutions of Mahler Equations,ive rings as well as over finite fields of any characteristic. The main tool for our investigation will be the .-equation-kernel of a rational function. We show that there is a close relation between the finiteness of an .-equation-kernel and the finiteness of the .-kernel of a solution.

變色龍

craven

DOSE

978-1-85233-196-2Springer-Verlag London 1999

uncertain

Overview: 978-1-85233-196-2978-1-4471-0551-0