Atjaunināt sīkdatņu piekrišanu

E-grāmata: Sequences and Their Applications - SETA 2008: 5th International Conference Lexington, KY, USA, September 14-18, 2008, Proceedings

Edited by , Edited by , Edited by , Edited by
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 5203
  • Izdošanas datums: 15-Sep-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783540859123
Citas grāmatas par šo tēmu:
  • 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.
  • Formāts: PDF+DRM
  • Sērija : Lecture Notes in Computer Science 5203
  • Izdošanas datums: 15-Sep-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Valoda: eng
  • ISBN-13: 9783540859123
Citas grāmatas par šo tēmu:

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 book constitutes the refereed proceedings of the 5th International Conference on Sequences and Their Applications, SETA 2008, held in Lexington, KY, USA in September 2008.
The 32 revised full papers presented were carefully reviewed and selected. The papers are organized in topical sections on probabilistic methods and randomness properties of sequences; correlation; combinatorial and algebraic foundations; security aspects of sequences; algorithms; correlation of sequences over rings; nonlinear functions over finite fields.

Probabilistic Methods and Randomness Properties of Sequences.-
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random
Number Generation.- On Independence and Sensitivity of Statistical Randomness
Tests.- New Distinguishers Based on Random Mappings against Stream Ciphers.-
A Probabilistic Approach on Estimating the Number of Modular Sonar
Sequences.- A Study on the Pseudorandom Properties of Sequences Generated Via
the Additive Order.- On the Average Distribution of Power Residues and
Primitive Elements in Inversive and Nonlinear Recurring Sequences.-
Correlation.- Some Results on the Arithmetic Correlation of Sequences.- A
Class of Nonbinary Codes and Sequence Families.- Results on the
Crosscorrelation and Autocorrelation of Sequences.- m-Sequences of Lengths
22k ??1 and 2 k ???1 with at Most Four-Valued Cross Correlation.- On the
Correlation Distribution of Kerdock Sequences.- Two New Families of
Low-Correlation Interleaved QAM Sequences.- Combinatorial and Algebraic
Foundations.- The Combinatorics of Differentiation.- Group Representation
Design of Digital Signals and Sequences.- Projective de Bruijn Sequences.-
Multiplicative Character Sums of Recurring Sequences with Rédei Functions.-
On the Connection between Kloosterman Sums and Elliptic Curves.- A Class of
Optimal Frequency Hopping Sequences Based upon the Theory of Power Residues.-
Security Aspects of Sequences.- Sequences, DFT and Resistance against Fast
Algebraic Attacks.- Expected ?-Adic Security Measures of Sequences.-
Distance-Avoiding Sequences for Extremely Low-Bandwidth Authentication.- On
the Number of Linearly Independent Equations Generated by XL.- 2 n -Periodic
Binary Sequences with Fixed k-Error Linear Complexity for k?=?2 or 3.-
Generalized Joint LinearComplexity of Linear Recurring Multisequences.-
Algorithms.- A Lattice-Based Minimal Partial Realization Algorithm.- A Fast
Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space.- Parallel
Generation of ?-Sequences.- Correlation of Sequences over Rings.- Design of
M-Ary Low Correlation Zone Sequence Sets by Interleaving.- The Peak to
Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings.-
On Partial Correlations of Various Z 4 Sequence Families.- Nonlinear
Functions over Finite Fields.- On the Higher Order Nonlinearities of Boolean
Functions and S-Boxes, and Their Generalizations.- On a Class of Permutation
Polynomials over .- On 3-to-1 and Power APN S-Boxes.- Negabent Functions
in the MaioranaMcFarland Class.- New Perfect Nonlinear Multinomials over F
for Any Odd Prime p.- A New Tool for Assurance of Perfect Nonlinearity.