{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":3,"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":57,"n_cols":5,"rows_kept":57,"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],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[15,2,15,3],[16,2,16,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[22,2,22,3],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[27,2,27,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[36,2,36,3],[45,2,45,3],[46,2,46,3],[49,2,49,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA990000248390203316"]
[null,null,"Autore",null,"Dreizler, R. M."]
[null,null,"Titolo",null,"Density functional theory : an approach to the quantum many-body problem / R. M. Dreizler, E. K. U. Gross"]
[null,null,"Pubbl/distr/stampa",null,"Berlin [etc.] : Springer-Verlag, copyr. 1990"]
[null,null,"ISBN",null,"3-540-51993-9"]
[null,null,"Descrizione fisica",null,"XI, 302 p. : ill. ; 24 cm"]
[null,null,"Disciplina",null,"530"]
[null,null,"Collocazione",null,"530.144 DRE"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA990001686260203316"]
[null,null,"Autore",null,"ISTAT"]
[null,null,"Titolo",null,"Vol. 3.1. : Piemonte / ISTAT"]
[null,null,"Pubbl/distr/stampa",null,"Roma : Istituto Centrale di Statistica, 1963-"]
[null,null,"Descrizione fisica",null,"v. : ill. ; 30 cm"]
[null,null,"Soggetti",null,"Italia - Censimenti - 1961"]
[{"$nulls":4},"Valle d'Aosta - Popolazione - Censimenti - 1961"]
[null,null,"Collocazione",null,"I i 367/3 I"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"<Vol. 3.1.> : Provincia di Torino. - 1966. - 171 p. ; <Vol. 3.2.> : Provincia di Vercelli. - 1965. - 103 p. ; <Vol. 3.3> : Provincia di Novara. - 1966. - 103 p. ; <Vol. 3.4.> : Provincia di Cuneo. - 1966. - 143 p. ; <Vol. 3.5.> : Provincia di Asti. - 1964. - 1964. - 73 p. ; <Vol. 3.6.> : Provincia di Alessandria. - 1966. - 105 p. ; <Vol. 3.7.> : Valle d'Aosta. - 1964. - 45 p."]
[null,"3.","Record Nr.",null,"UNINA9910143714103321"]
[null,null,"Autore",null,"Morelos-Zaragoza Robert H"]
[null,null,"Titolo",null,"The Art of Error Correcting Coding [[electronic resource]]"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, : Wiley, 2006"]
[null,null,"ISBN",null,"1-280-51916-9"]
[{"$nulls":4},"9786610519163"]
[{"$nulls":4},"0-470-03570-6"]
[{"$nulls":4},"0-470-03569-2"]
[null,null,"Edizione",null,"[2nd ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (279 p.)"]
[null,null,"Classificazione",null,"54.10"]
[null,null,"Disciplina",null,"621.3822"]
[{"$nulls":4},"621.38220151"]
[null,null,"Soggetti",null,"Computer algorithms"]
[{"$nulls":4},"Error-correcting codes (Information theory)"]
[{"$nulls":4},"Mathematics"]
[{"$nulls":4},"Electrical & Computer Engineering"]
[{"$nulls":4},"Telecommunications"]
[{"$nulls":4},"Algebra"]
[{"$nulls":4},"Engineering & Applied Sciences"]
[{"$nulls":4},"Physical Sciences & Mathematics"]
[{"$nulls":4},"Electronic books."]
[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","Description based upon print version of record."]
[null,null,"Nota di contenuto",null,"The Art of Error Correcting Coding; Contents; Preface; Foreword; The ECC web site; 1 Introduction; 1.1 Error correcting coding: Basic concepts; 1.1.1 Block codes and convolutional codes; 1.1.2 Hamming distance, Hamming spheres and error correcting capability; 1.2 Linear block codes; 1.2.1 Generator and parity-check matrices; 1.2.2 The weight is the distance; 1.3 Encoding and decoding of linear block codes; 1.3.1 Encoding with G and H; 1.3.2 Standard array decoding; 1.3.3 Hamming spheres, decoding regions and the standard array; 1.4 Weight distribution and error performance"]
[{"$nulls":4},"1.4.1 Weight distribution and undetected error probability over a BSC1.4.2 Performance bounds over BSC, AWGN and fading channels; 1.5 General structure of a hard-decision decoder of linear codes; Problems; 2 Hamming, Golay and Reed-Muller codes; 2.1 Hamming codes; 2.1.1 Encoding and decoding procedures; 2.2 The binary Golay code; 2.2.1 "]
[{"$nulls":4},"Encoding; 2.2.2 Decoding; 2.2.3 Arithmetic decoding of the extended (24, 12, 8) Golay code; 2.3 Binary Reed-Muller codes; 2.3.1 Boolean polynomials and RM codes; 2.3.2 Finite geometries and majority-logic decoding; Problems; 3 Binary cyclic codes and BCH codes"]
[{"$nulls":4},"3.1 Binary cyclic codes3.1.1 Generator and parity-check polynomials; 3.1.2 The generator polynomial; 3.1.3 Encoding and decoding of binary cyclic codes; 3.1.4 The parity-check polynomial; 3.1.5 Shortened cyclic codes and CRC codes; 3.1.6 Fire codes; 3.2 General decoding of cyclic codes; 3.2.1 GF(2m) arithmetic; 3.3 Binary BCH codes; 3.3.1 BCH bound; 3.4 Polynomial codes; 3.5 Decoding of binary BCH codes; 3.5.1 General decoding algorithm for BCH codes; 3.5.2 The Berlekamp-Massey algorithm (BMA); 3.5.3 PGZ decoder; 3.5.4 Euclidean algorithm; 3.5.5 Chien search and error correction"]
[{"$nulls":4},"3.5.6 Errors-and-erasures decoding3.6 Weight distribution and performance bounds; 3.6.1 Error performance evaluation; Problems; 4 Nonbinary BCH codes: Reed-Solomon codes; 4.1 RS codes as polynomial codes; 4.2 From binary BCH to RS codes; 4.3 Decoding RS codes; 4.3.1 Remarks on decoding algorithms; 4.3.2 Errors-and-erasures decoding; 4.4 Weight distribution; Problems; 5 Binary convolutional codes; 5.1 Basic structure; 5.1.1 Recursive systematic convolutional codes; 5.1.2 Free distance; 5.2 Connections with block codes; 5.2.1 Zero-tail construction; 5.2.2 Direct-truncation construction"]
[{"$nulls":4},"5.2.3 Tail-biting construction5.2.4 Weight distributions; 5.3 Weight enumeration; 5.4 Performance bounds; 5.5 Decoding: Viterbi algorithm with Hamming metrics; 5.5.1 Maximum-likelihood decoding and metrics; 5.5.2 The Viterbi algorithm; 5.5.3 Implementation issues; 5.6 Punctured convolutional codes; 5.6.1 Implementation issues related to punctured convolutional codes; 5.6.2 RCPC codes; Problems; 6 Modifying and combining codes; 6.1 Modifying codes; 6.1.1 Shortening; 6.1.2 Extending; 6.1.3 Puncturing; 6.1.4 Augmenting, expurgating and lengthening; 6.2 Combining codes"]
[{"$nulls":4},"6.2.1 Time sharing of codes"]
[null,null,null,"Sommario/riassunto","Building on the success of the first edition, which offered a practical introductory approach to the techniques of error concealment, this book, now fully revised and updated, provides a comprehensive treatment of the subject and includes a wealth of additional features. The Art of Error Correcting Coding, Second Edition explores intermediate and advanced level concepts as well as those which will appeal to the novice. All key topics are discussed, including Reed-Solomon codes, Viterbi decoding, soft-output decoding algorithms, MAP, log-MAP and MAX-log-MAP.  Reliability-based algorith"]