Sequences and their Applications: Proceedings of SETA ’01: Discrete Mathematics and Theoretical Computer Science
Editat de T. Helleseth, P.V. Kumar, K. Yangen Limba Engleză Paperback – 17 oct 2001
This volume contains survey and research papers on sequences and their applications. It brings together leading experts from discrete mathematics, computer science and communications engineering, and helps to bridge advances in these different areas. Papers in this volume discuss the theory of sequences and their applications in cryptography, coding theory, communications systems, numerical computation and computer simulation.
Preț: 642.36 lei
Preț vechi: 755.72 lei
-15% Nou
Puncte Express: 964
Preț estimativ în valută:
122.91€ • 128.68$ • 101.70£
122.91€ • 128.68$ • 101.70£
Carte tipărită la comandă
Livrare economică 07-21 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781852335298
ISBN-10: 1852335297
Pagini: 336
Ilustrații: VIII, 324 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.47 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: SPRINGER LONDON
Colecția Springer
Seria Discrete Mathematics and Theoretical Computer Science
Locul publicării:London, United Kingdom
ISBN-10: 1852335297
Pagini: 336
Ilustrații: VIII, 324 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.47 kg
Ediția:Softcover reprint of the original 1st ed. 2002
Editura: SPRINGER LONDON
Colecția Springer
Seria Discrete Mathematics and Theoretical Computer Science
Locul publicării:London, United Kingdom
Public țintă
Professional/practitionerCuprins
Invited Contributions.- Uniformly Representable Permutation Polynomials.- New p-ary Perfect Sequences and Difference Sets with Singer Parameters.- On the Crosscorrelation of m-Sequences and Related Sequences with Ideal Autocorrelation.- Sequences for OFDM and Multi-Code CDMA: Two Problems in Algebraic Coding Theory.- Signal Design for Ultra-wideband Radio.- Constructions of Sequences from Algebraic Curves over Finite Fields.- Regular Contributions.- Description of Binary Sequences Based on the Interval Linear Complexity Profile.- On the Number of Kernel Elements of Automatic Sequences.- On the Coset Weight Divisibility and Nonlinearity of Resilient and Correlation-Immune Functions.- On the Linear Complexity of Generalised Legendre Sequence.- Hyper-Cyclotomic Algebra.- Cyclic Projective Planes, Perfect Circular Rulers, and Good Spanning Rulers.- Linear Recursive Sequences over Elliptic Curves.- On the Distinctness of Decimations of ?-Sequences.- On Binary Sequences of Period pm ?1 with Optimal Autocorrelation.- On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(pm) with Period pn.- Constant Sum Implies Statistical Independence of Chaotic Sequences.- First-Order Optimal Approximation of Binary Sequences.- On the Uniformity of Distribution of Congruential Generators over Elliptic Curves.- Further Constructions of Resilient Boolean Functions with Very High Nonlinearity.- On Certain 3-Weight Cyclic Codes Having Symmetric Weights and a Conjecture of Helleseth.- The Quantum Entanglement of Binary and Bipolar Sequences.- Characteristic Polynomials of Binary Kronecker Sequences.- The Generation of PseudoRandom Numbers for the Simulation of White Gausssian Noise.- Author Index.