Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Sequences and Their Applications - SETA 2004 [[electronic resource] ] : Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers / / edited by Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yang
| Sequences and Their Applications - SETA 2004 [[electronic resource] ] : Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers / / edited by Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yang |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 451 p.) |
| Disciplina | 003.54 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Computer science Algorithms Numerical analysis Computer science—Mathematics Coding and Information Theory Cryptology Theory of Computation Numerical Analysis Symbolic and Algebraic Manipulation |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- A Survey of Some Recent Results on Bent Functions -- A Survey of the Merit Factor Problem for Binary Sequences -- A Survey of Feedback with Carry Shift Registers -- Univariate and Multivariate Merit Factors -- Complexity of Sequences I -- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences -- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences -- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences -- A Unified View on Sequence Complexity Measures as Isometries -- Complexity of Sequences II -- One-Error Linear Complexity over F p of Sidelnikov Sequences -- On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences -- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two -- On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences -- Perfect Sequences -- Almost-Perfect and Odd-Perfect Ternary Sequences -- Cross-Correlation Properties of Perfect Binary Sequences -- Sequence Constructions -- New Sets of Binary and Ternary Sequences with Low Correlation -- Improved p-ary Codes and Sequence Families from Galois Rings -- Quadriphase Sequences Obtained from Binary Quadratic Form Sequences -- New Families of p-Ary Sequences from Quadratic Form with Low Correlation and Large Linear Span -- Sequences over ? m -- On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers -- Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over -- Sequence Generator Properties and Applications -- Algebraic Feedback Shift Registers Based on Function Fields -- New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP) -- Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator -- Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2 -- Multi-dimensional Sequences -- Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2 -- A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels -- New Constructions of Quaternary Hadamard Matrices -- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform -- Optics and OFDM Applications -- New Constructions and Bounds for 2-D Optical Orthogonal Codes -- Topics on Optical Orthogonal Codes -- Weighted Degree Trace Codes for PAPR Reduction -- Polynomials and Functions -- Which Irreducible Polynomials Divide Trinomials over GF(2)? -- Autocorrelation Properties of Resilient Functions and Three-Valued Almost-Optimal Functions Satisfying PC(p) -- Group Algebras and Correlation Immune Functions. |
| Record Nr. | UNISA-996465683103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Sequences and Their Applications – SETA 2006 [[electronic resource] ] : 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings / / edited by Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang
| Sequences and Their Applications – SETA 2006 [[electronic resource] ] : 4th International Conference, Beijing, China, September 24-28, 2006, Proceedings / / edited by Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 436 p.) |
| Disciplina | 515/.24 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Computer science Algorithms Numerical analysis Computer science—Mathematics Coding and Information Theory Cryptology Theory of Computation Numerical Analysis Symbolic and Algebraic Manipulation |
| ISBN | 3-540-44524-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Shift Register Sequences – A Retrospective Account -- The Probabilistic Theory of the Joint Linear Complexity of Multisequences -- Multi-Continued Fraction Algorithms and Their Applications to Sequences -- Codes for Optical CDMA -- Linear Complexity of Sequences -- On the Linear Complexity of Sidel’nikov Sequences over -- Linear Complexity over F p of Ternary Sidel’nikov Sequences -- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences -- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity -- Correlation of Sequences -- Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation -- Extended Hadamard Equivalence -- Analysis of Designing Interleaved ZCZ Sequence Families -- Stream Ciphers and Transforms -- Security of Jump Controlled Sequence Generators for Stream Ciphers -- Improved Rijndael-Like S-Box and Its Transform Domain Analysis -- Topics in Complexities of Sequences -- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression -- On Lempel-Ziv Complexity of Sequences -- Computing the k-Error N-Adic Complexity of a Sequence of Period p n -- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences -- Linear/Nonlinear Feedback Shift Register Sequences -- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes -- Sequences of Period 2 N –2 -- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences -- Multi-sequence Synthesis -- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis -- The Hausdorff Dimension of the Set of r-Perfect M-Multisequences -- Filtering Sequences and Pseudorandom Sequence Generators -- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants -- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm -- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences -- Sequences and Combinatorics -- Nonexistence of a Kind of Generalized Perfect Binary Array -- FCSR Sequences -- On the Distinctness of Decimations of Generalized l-Sequences -- On FCSR Memory Sequences -- Periodicity and Distribution Properties of Combined FCSR Sequences -- Aperiodic Correlation and Applications -- Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences -- Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance -- Boolean Functions -- On Immunity Profile of Boolean Functions -- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators -- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function -- Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions -- Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. |
| Record Nr. | UNISA-996466097103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||