Atjaunināt sīkdatņu piekrišanu

E-grāmata: Sequences and Their Applications - SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings

Edited by , Edited by
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This volumecontainstherefereedproceedingsoftheSixth International Conf- ence on Sequences and Their Applications (SETA 2010), held in Paris, France, September 13-17, 2010. The previous ?ve conferences were held in Singapore (RepublicofSingapore),Bergen(Norway),Seoul(SouthKorea),Beijing(China) and Lexington (USA). Topics of SETA include: - Randomness of sequences - Correlation (periodic and aperiodic types) and combinatorial aspects of - quences (di erence sets) - Sequences with applications in coding theory and cryptography - Sequences over ?nite ?elds/rings/function ?elds - Linear and nonlinear feedback shift register sequences - Sequences for radar distance ranging, synchronization, identi cation, and hardware testing - Sequences for wireless communication - Pseudorandom sequence generators - Boolean and vectorial functions for sequences, coding and/or cryptography - Multidimensional sequences and their correlation properties - Linear and nonlinear complexity of sequences The Technical Program Committee of SETA 2010 refereed 56 submitted - pers. Each paper was reviewed by at least 2 referees (at least 3 when an author was a TPC member) and the TPC selected 33 papers to be presented at the conference. In addition, we had 4 invited papers, byRobert Calderbank(Prin- ton University, USA), James Massey (retired from ETH Zurich, Switzerland), Jong-Seon No (Seoul National University, South Korea) and Arne Winterhof .. (Osterreichische Akademie der Wissenschaften, Austria). TheCo-chairsoftheTPCwereClaudeCarlet(Universit' eParis8,France)and Alexander Pott (Otto-von-Guericke-Universit. at, Magdeburg, Germany). They wish to thank the other members of the ProgramCommittee: Thierry P.
Invited Paper.- Low Correlation Zone Sequences.- Algorithmic Aspects.-
Decimation Generator of Zadoff-Chu Sequences.- An Algorithm for Constructing
a Fastest Galois NLFSR Generating a Given Sequence.- Acquisition Times of
Contiguous and Distributed Marker Sequences: A Cross-Bifix Analysis.-
Frequency Hopping.- Lower Bounds on the Average Partial Hamming Correlations
of Frequency Hopping Sequences with Low Hit Zone.- New Families of
Frequency-Hopping Sequences of Length mN Derived from the k-Fold Cyclotomy.-
Multiple Access Systems.- User-Irrepressible Sequences.- New Optimal
Variable-Weight Optical Orthogonal Codes.- Invited Paper.- Recent Results on
Recursive Nonlinear Pseudorandom Number Generators.- Linear Complexity.- A
General Approach to Construction and Determination of the Linear Complexity
of Sequences Based on Cosets.- On the Autocorrelation and the Linear
Complexity of q-Ary Prime n-Square Sequences.- An Improved Approximation
Algorithm for Computing the k-Error Linear Complexity of Sequences Using the
Discrete Fourier Transform.- Finite Fields.- Transformations on Irreducible
Binary Polynomials.- Power Permutations in Dimension 32.- Character Sums.-
Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential
Pseudorandom Number Generators.- Ternary Kloosterman Sums Modulo 18 Using
Stickelbergers Theorem.- Merit Factor.- Appended m-Sequences with Merit
Factor Greater than 3.34.- FCSR.- A With-Carry Walsh Transform.-
Clock-Controlled FCSR Sequence with Large Linear Complexity.- Vectorial
Conception of FCSR.- Hadamard Matrices and Transforms.- Fourier Duals of
Björck Sequences.- New Constructions of Complete Non-cyclic Hadamard
Matrices, Related Function Families and LCZ Sequences.- Cryptography.-
?4-Nonlinearity of a ConstructedQuaternary Cryptographic Functions Class.- A
Public Key Cryptosystem Based upon Euclidean Addition Chains.- Optimal
Authentication Codes from Difference Balanced Functions.- Invited Paper.- New
Extensions and Applications of Welch-Bound-Equality Sequence Sets.-
Statistical Analysis.- Evaluation of Randomness Test Results for Short
Sequences.- Statistical Analysis of Search for Set of Sequences in Random and
Framed Data.- Boolean Functions and Related Problems.- On the Nonlinearity of
Discrete Logarithm in .- On a Conjecture about Binary Strings
Distribution.- NegaHadamard Transform, Bent and Negabent Functions.-
Synchronization of Boolean Dynamical Systems: A Spectral Characterization.-
Nonbinary Sequences.- Some Constructions of Almost-Perfect, Odd-Perfect and
Perfect Polyphase and Almost-Polyphase Sequences.- Almost p-Ary Perfect
Sequences.- Sequences, Bent Functions and Jacobsthal Sums.- Infinite
Sequences.- Infinite Sequences with Finite Cross-Correlation.- Invited
Paper.- Reed Muller Sensing Matrices and the LASSO.