Seoul, Korea Tor Helleseth, Dilip V. Sarwate, Hong-Yeop Song, Kyeongcheol Yang (Eds.):
Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers.
Lecture Notes in Computer Science 3486 Springer 2005, ISBN 3-540-26084-6
Complexity of Sequences I
- Wilfried Meidl:
Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences.
- Xiutao Feng, Zongduo Dai:
Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences.
- Zongduo Dai, Kyoki Imamura, Junhui Yang:
Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences.
- Michael Vielhaber:
A Unified View on Sequence Complexity Measures as Isometries.
Complexity of Sequences II
- Yu-Chang Eun, Hong-Yeop Song, Gohar M. M. Kyureghyan:
One-Error Linear Complexity over Fp of Sidelnikov Sequences.
- Takayasu Kaida:
On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences.
- Ana Salagean:
On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two.
- Honggang Hu, Dengguo Feng:
On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences.
- Evgeny I. Krengel:
Almost-Perfect and Odd-Perfect Ternary Sequences.
- Doreen Hertel:
Cross-Correlation Properties of Perfect Binary Sequences.
Sequences over Zm
Sequence Generator Properties and Applications
Optics and OFDM Applications
Polynomials and Functions
Last update Mon May 20 15:56:13 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page