{"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":27,"n_cols":5,"rows_kept":27,"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],[9,2,9,3],[10,2,10,3],[12,2,12,3],[14,2,14,3],[15,2,15,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911019195603321"]
[null,null,"Autore",null,"Moon Todd K"]
[null,null,"Titolo",null,"Error correction coding [[electronic resource] ] : mathematical methods and algorithms / / Todd K. Moon"]
[null,null,"Pubbl/distr/stampa",null,"Hoboken, N.J., : Wiley-Interscience, 2005"]
[null,null,"ISBN",null,"1-280-27717-3"]
[{"$nulls":4},"9786610277179"]
[{"$nulls":4},"0-470-36081-X"]
[{"$nulls":4},"0-471-73921-9"]
[{"$nulls":4},"0-471-73914-6"]
[null,null,"Descrizione fisica",null,"1 online resource (802 p.)"]
[null,null,"Disciplina",null,"621.382/0285/572"]
[{"$nulls":4},"621.3820285572"]
[null,null,"Soggetti",null,"Engineering mathematics"]
[{"$nulls":4},"Error-correcting codes (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","\"A John Wiley & Sons, Inc. publication.\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Error Correction Coding Mathematical Methods and Algorithms; Preface; Contents; List of Program Files; List of Laboratory Exercises; List of Algorithms; List of Figures; List of Tables; List of Boxes; Part I Introduction and Foundations; 1 A Context for Error Correction Coding; 1.1 Purpose of This Book; 1.2 Introduction: Where Are Codes?; 1.3 The Communications System; 1.4 Basic Digital Communications; 1.4.1 Binary Phase-Shift Keying; 1.4.2 More General Digital Modulation; 1.5 Signal Detection; 1.5.1 The Gaussian Channel; 1.5.2 MAP and ML Detection; 1.5.3 Special Case: Binary Detection"]
[{"$nulls":4},"1.5.4 Probability of Error for Binary Detection1.5.5 Bounds on Performance: The Union Bound; 1.5.6 The Binary Symmetric Channel; 1.5.7 The BSC and the Gaussian Channel Model; 1.6 Memoryless Channels; 1.7 Simulation and Energy Considerations for Coded Signals; 1.8 Some Important Definitions; 1.8.1 Detection of Repetition Codes Over a BSC; 1.8.2 Soft-Decision Decoding of Repetition Codes Over the AWGN; 1.8.3 Simulation of Results; 1.8.4 Summary; 1.9 Hamming Codes; 1.9.1 Hard-Input Decoding Hamming Codes; 1.9.2 Other Representations of the Hamming Code; An Algebraic Representation"]
[{"$nulls":4},"A Polynomial RepresentationA Trellis Representation; The Tanner Graph Representation; 1.10 The Basic Questions; 1.11 Historical Milestones of "]
[{"$nulls":4},"Coding Theory; 1.12 A Bit of Information Theory; 1.12.1 Definitions for Discrete Random Variables; Entropy and Conditional Entropy; Relative Entropy, Mutual Information, and Channel Capacity; 1.12.2 Definitions for Continuous Random Variables; 1.12.3 The Channel Coding Theorem; 1.12.4 \"Proof\" of the Channel Coding Theorem; 1.12.5 Capacity for the Continuous-Time AWGN Channel; 1.12.6 Transmission at Capacity with Errors"]
[{"$nulls":4},"1.12.7 The Implication of the Channel Coding TheoremLab 1 Simulating a Communications Channel; Objective; Background; Use of Coding in Conjunction with the BSC; Assignment; Programming Part; Resources and Implementation Suggestions; 1.13 Exercises; 1.14 References; Part II Block Codes; 2 Groups and Vector Spaces; 2.1 Introduction; 2.2 Groups; 2.2.1 Subgroups; 2.2.2 Cyclic Groups and the Order of an Element; 2.2.3 Cosets; 2.2.4 Lagrange's Theorem; 2.2.5 Induced Operations;  Isomorphism; 2.2.6 Homomorphism; 2.3 Fields: A Prelude; 2.4 Review of Linear Algebra; 2.5 Exercises; 2.6 References"]
[{"$nulls":4},"3 Linear Block Codes3.1 Basic Definitions; 3.2 The Generator Matrix Description of Linear Block Codes; 3.2.1 Rudimentary Implementation; 3.3 The Parity Check Matrix and Dual Codes; 3.3.1 Some Simple Bounds on Block Codes; 3.4 Error Detection and Correction over Hard-Input Channels; 3.4.1 Error Detection; 3.4.2 Error Correction: The Standard Array; 3.5 Weight Distributions of Codes and Their Duals; 3.6 Hamming Codes and Their Duals; 3.7 Performance of Linear Codes; 3.7.1 Error detection performance; 3.7.2 Error Correction Performance; 3.7.3 Performance for Soft-Decision Decoding"]
[{"$nulls":4},"3.8 Erasure Decoding"]
[null,null,null,"Sommario/riassunto","An unparalleled learning tool and guide to error correction codingError correction coding techniques allow the detection and correction of errors occurring during the transmission of data in digital communication systems. These techniques are nearly universally employed in modern communication systems, and are thus an important component of the modern information economy.Error Correction Coding: Mathematical Methods and Algorithms provides a comprehensive introduction to both the theoretical and practical aspects of error correction coding, with a presentation suitable for a wi"]