{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":39,"n_cols":5,"rows_kept":39,"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],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[21,2,21,3],[22,2,22,3],[26,2,26,3],[28,2,28,3],[28,4,28,5],[29,2,29,3],[29,4,29,5],[30,2,30,3],[30,4,30,5],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466097103316"]
[null,null,"Titolo",null,"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"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006"]
[null,null,"ISBN",null,"3-540-44524-2"]
[null,null,"Edizione",null,"[1st ed. 2006.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 436 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4086"]
[null,null,"Disciplina",null,"515/.24"]
[null,null,"Soggetti",null,"Coding theory"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Coding and Information Theory"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Symbolic and Algebraic Manipulation"]
[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 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 "]
[{"$nulls":4},"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."]
[null,"2.","Record Nr.",null,"UNISALENTO991001915499707536"]
[null,null,"Autore",null,"Marrone, Matteo"]
[null,null,"Titolo",null,"L'effetto normativo della sentenza : corso di diritto romano / Matteo Marrone"]
[null,null,"Pubbl/distr/stampa",null,"Palermo : U. Manfredi, 1965"]
[null,null,"Edizione",null,"[2. ed.]"]
[null,null,"Descrizione fisica",null,"228 p. ; 21 cm."]
[null,null,"Disciplina",null,"349.37"]
[null,null,"Soggetti",null,"Sentenze - Diritto romano"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]