Sequences and their Applications
Proceedings of SETA '98
Published on 17. September 1999
Book
Paperback/Softback
IX, 395 pages
978-1-85233-196-2 (ISBN)
Description
This volume contains the refereed proceedings of the International Conference on Sequences and Their Applications which was held at the River View Ho- tel in Singapore during December 14-17, 1998. The program of this conference was arranged by a committee consisting of Claude Carlet (University of Caen) , Agnes Chan (Northeastern University), Cunsheng Ding (National University of Singapore, co-chair), Dieter Gollmann (Microsoft Research), Tor Helleseth (Uni- versity of Bergen, co-chair), Kyoki Imamura (Kyushu Institute of Technology), Andrew Klapper (University of Kentucky), Vijay Kumar (University of Southern California), Siu Lun Ma (National University of Singapore), Harald Niederreiter (A ustrian Academy of Sciences, co-chair), Dilip Sarwate (University of Illinois at Urbana-Champaign), Hans Schotten (Aachen University of Technology), Jeffrey Shallit (University of Waterloo), Neil Sloane (AT&T Shannon Lab), and Aimo Tietiivajnen (University of Turku). The local organization was in the hands of Cunsheng Ding, Kwok Van Lam (chair), Sjauntele Lau, and Sew Kiok Toh, all of the National University of Singapore.
The idea for the conference grew out of the recognition that sequences in discrete structures like the ring of integers, residue class rings of the integers, and finite fields have found many important applications in modern information and communication technologies. Among these applications we mention cryp- tographic schemes, ranging systems, spread spectrum communication systems, multi-terminal system identification, code-division mUltiple-access communica- tion systems, global positioning systems, software testing, circuit testing, and computer simulation. There are also connections between sequences in discrete structures and error-correcting codes.
The idea for the conference grew out of the recognition that sequences in discrete structures like the ring of integers, residue class rings of the integers, and finite fields have found many important applications in modern information and communication technologies. Among these applications we mention cryp- tographic schemes, ranging systems, spread spectrum communication systems, multi-terminal system identification, code-division mUltiple-access communica- tion systems, global positioning systems, software testing, circuit testing, and computer simulation. There are also connections between sequences in discrete structures and error-correcting codes.
More details
Series
Edition
1999 ed.
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Professional/practitioner
Illustrations
IX, 395 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 23 mm
Weight
616 gr
ISBN-13
978-1-85233-196-2 (9781852331962)
DOI
10.1007/978-1-4471-0551-0
Schweitzer Classification
Other editions
Additional editions
E-Book
12/2012
Springer
€149.79
Available for download
Content
Invited Contributions.- The Ubiquitous Prouhet-Thue-Morse Sequence.- On Ideal Autocorrelation Sequences Arising from Hyperovals.- Cyclic Hadamard Difference Sets - Constructions and Applications.- Correlation ofm-Sequences and Related Topics.- Some Computable Complexity Measures for Binary Sequences.- Meeting the Welch Bound with Equality.- My Favorite Integer Sequences.- Regular Contributions.- Complementary Interpolants and a Welch-Berlekamp-Style Algorithm.- Multiscale Coarse-Graining Invariant Sequences.- Regular Cosets and Upper Bounds on the Linear Complexity of Certain Sequences.- Hadamard Matrices, Self-Dual Codes over the Integers Modulo 4 and their Gray Images.- On Constructing Balanced Correlation Immune Functions.- On Bispecial Words and Subword Complexity of DOL Sequences.- On the Distribution of the RSA Generator.- Edit Probability Correlation Attack on the Alternating Step Generator.- Automaticity of Solutions of Mahler Equations.- Correlation Distribution of the Quaternary Kasami Sequences.- Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers.- Inclusion Relations of Boolean Functions Satisfying PC(l) of Orderk.- Notes onq-ary Interleaved Sequences.- A New Algorithm for the k-Error Linear Complexity of Sequences over GF (pm) with Period pn.- Sequences of I.I.D. Binary Random Variables Using Chaotic Dynamics.- Explicit Sequence Expansions.- Counting Functions and Expected Values in the Stability Theory of Stream Ciphers.- On-Line Constraint-Based Pattern Matching on Sequences.- On the Randomness of a [d,k]Self-Decimation Stream Key Generator.- Sequence Families with Optimum Aperiodic Mean-Square Correlation Parameters.- Period and Linear Complexity of Cascaded Clock-Controlled Generators.- Feedback with Carry ShiftRegisters over Z/(N).- Author Index.