{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":33,"n_cols":5,"rows_kept":33,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[24,2,24,3],[25,2,25,3],[29,2,29,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910483503103321"]
[null,null,"Titolo",null,"Sequences and Their Applications - SETA 2010 : 6th International Conference, Paris, France, September 13-17, 2010. Proceedings / / edited by Claude Carlet, Alexander Pott"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38916-8"]
[{"$nulls":4},"9786613567086"]
[{"$nulls":4},"3-642-15874-9"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 465 p. 50 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6338"]
[null,null,"Disciplina",null,"515.24"]
[null,null,"Soggetti",null,"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Electronic data processing - Management"]
[{"$nulls":4},"Coding theory"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"IT Operations"]
[{"$nulls":4},"Coding and Information Theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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-"]
[{"$nulls":4},"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 Stickelberger’s 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 -- Nega–Hadamard 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."]
[null,null,null,"Sommario/riassunto","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 "]
[{"$nulls":4},"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."]