{"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":25,"n_cols":5,"rows_kept":25,"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],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[12,2,12,3],[13,2,13,3],[17,2,17,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910465421903321"]
[null,null,"Titolo",null,"Algebraic geometry modeling in information theory [[electronic resource] /] / edited by Edgar Martinez Moro"]
[null,null,"Pubbl/distr/stampa",null,"Hackensack, NJ, : World Scientific, 2013"]
[null,null,"ISBN",null,"1-299-28125-7"]
[{"$nulls":4},"981-4335-76-2"]
[null,null,"Descrizione fisica",null,"1 online resource (334 p.)"]
[null,null,"Collana",null,"Series on coding theory and cryptology ; ; v. 8"]
[null,null,"Disciplina",null,"003/.54"]
[null,null,"Soggetti",null,"Coding theory"]
[{"$nulls":4},"Geometry, Algebraic"]
[{"$nulls":4},"Cryptography"]
[{"$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,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Contents; Preface; Sage: A Basic Overview for Coding Theory and Cryptography D. Joyner; 0.1. Introduction; 0.2. What is Sage?; 0.2.1. Functionality of selected components of Sage; 0.2.2. History; 0.2.3. Why Python?; 0.2.4. The CLI; 0.2.5. The GUI; 0.2.6. Open source philosophy; 0.3. Coding theory functionality in Sage; 0.3.1. General constructions; 0.3.2. Coding theory functions; 0.3.3. Weight enumerator polynomial; 0.3.4. More code constructions; 0.3.5. Automorphism group of a code; 0.3.6. Even more code constructions; 0.3.7. Block designs and codes; 0.3.8. Special constructions"]
[{"$nulls":4},"0.3.9. Coding theory bounds0.3.10. Asymptotic bounds; 0.4. Cryptography in Sage; 0.4.1. Classical cryptography; 0.4.2. Algebraic cryptosystems; 0.4.3. RSA; 0.4.4. Discrete logs; 0.4.5. Diffle-Hellman; 0.4.6. Linear feedback shift registers; 0.4.7. BBS streamcipher; 0.4.8. Blum-Goldwasser cryptosystem; 0.5. Miscellaneous topics; 0.5.1. Duursma zeta functions; 0.5.2. Self-dual codes; 0.5.3. Cool example (on self-dual codes); 0.6. Coding theory not implemented in Sage; References; Aspects of Random Network Coding O. Geil and C. Thomsen; 1.1. Introduction; 1.2. The network coding problem"]
[{"$nulls":4},"1.2.1. Linear network coding for multicast1.2.2. A polynomial time algorithm for solving the multicast problem; 1.3. Random network coding; 1.3.1. The algebraic approach; 1.3.2. The combinatorial approach; 1.3.2.1. Flow bounds; 1.3.2.2. The bounds by Balli, Yan, and "]
[{"$nulls":4},"Zhang; 1.4. Bibliographic notes; References; Steganography from a Coding Theory Point of View C. Munuera; 2.1. Introduction; 2.1.1. What is steganography?; 2.1.2. Digital steganography; 2.1.3. Steganography, cryptography and watermarking; 2.1.4. About this chapter; 2.2. Steganographic systems; 2.2.1. The cover"]
[{"$nulls":4},"2.2.2. Steganographic schemes2.2.3. Selection rules; 2.2.4. Parameters; 2.2.5. Proper stegoschemes; 2.3. Error-Correcting codes; 2.3.1. Correcting errors; 2.3.2. Linear codes over fields; 2.3.3. An example: binary Hamming codes; 2.3.4. Generalized Hamming weights for linear codes; 2.4. Linking the problems; 2.4.1. Stegoschemes and error-correcting codes; 2.4.2. Group codes and stegoschemes; 2.4.3. Linear stegoschemes over rings Zq; 2.4.4. Linear stegoschemes over fields; 2.5. Bounds; 2.5.1. The domain of stegoschemes; 2.5.2. Balls and entropy; 2.5.3. A Hamming-like bound"]
[{"$nulls":4},"2.5.4. Asymptotic bounds2.5.5. Perfect stegoschemes; 2.5.6. Another new problem for coding theory; 2.6. Nonshared selection rules; 2.6.1. Wet paper codes; 2.6.2. Solvability and the weight hierarchy of codes; 2.6.3. The rank of random matrices; 2.7. The ZZW embedding construction; 2.7.1. Description of the method; 2.7.2. Asymptotic behavior; 2.8. Bibliographical notes and further reading; Acknowledgments; References; An Introduction to LDPC Codes I. Marquez-Corbella and E. Martınez-Moro; 3.1. Introduction; 3.2. Representation for LDPC codes; 3.2.1. Tanner graph; 3.3. Communication channels"]
[{"$nulls":4},"3.4. Decoding algorithms"]
[null,null,null,"Sommario/riassunto","Algebraic & geometry methods have constituted a basic background and tool for people working on classic block coding theory and cryptography. Nowadays, new paradigms on coding theory and cryptography have arisen such as: Network coding, S-Boxes, APN Functions, Steganography and decoding by linear programming. Again understanding the underlying procedure and symmetry of these topics needs a whole bunch of non trivial knowledge of algebra and geometry that will be used to both, evaluate those methods and search for new codes and cryptographic applications. This book shows those methods in a self"]