{"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":29,"n_cols":5,"rows_kept":29,"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],[4,2,4,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[16,2,16,3],[17,2,17,3],[21,2,21,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910141498103321"]
[null,null,"Titolo",null,"Network coding [[electronic resource] /] / edited by Khaldoun Al Agha"]
[null,null,"Pubbl/distr/stampa",null,"London, : ISTE"]
[{"$nulls":4},"Hoboken, N.J., : Wiley, 2012"]
[null,null,"ISBN",null,"1-118-56281-X"]
[{"$nulls":4},"1-299-18862-1"]
[{"$nulls":4},"1-118-56278-X"]
[{"$nulls":4},"1-118-56310-7"]
[null,null,"Descrizione fisica",null,"1 online resource (306 p.)"]
[null,null,"Collana",null,"ISTE ; ; 618"]
[null,null,"Classificazione",null,"COM043000"]
[null,null,"Disciplina",null,"004.6"]
[null,null,"Soggetti",null,"Coding theory"]
[{"$nulls":4},"Data transmission systems"]
[{"$nulls":4},"Computer networks - Mathematical models"]
[{"$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 bibliography (p. 285-287) and index."]
[null,null,"Nota di contenuto",null,"Cover; Title Page; Copyright Page; Table of Contents; Chapter 1. Network Coding: From Theory to Practice; 1.1. Introduction; 1.2. Theoretical approach; 1.2.1. Max-flow min-cut; 1.2.2. Admissible code; 1.2.3. Linear code; 1.2.4. Algebraic resolution; 1.2.5. Random code; 1.3. Practical approach; 1.3.1. Topologies; 1.3.1.1. Multihop wireless networks; 1.3.1.2. Cellular networks; 1.3.2. Applications; 1.3.2.1. Network coding and TCP; 1.3.2.2. Network coding and P2P; 1.3.2.3. Network coding with priority; 1.4. Conclusion; 1.5. Bibliography; Chapter 2. Fountain Codes and Network Coding for WSNs"]
[{"$nulls":4},"2.1. Introduction2.2. Fountain codes; 2.2.1. Generalities; 2.2.2. Families of fountain codes; 2.2.2.1. Random fountain codes; 2.2.2.2. Luby Transform (LT); 2.2.2.3. Raptor code; 2.2.2.4. Code complexity; 2.3. Fountain codes in WSNs; 2.3.1. Implementation; 2.3.2. Protocol of reliability enhancement: ARQs versus fountain codes; 2.3.3. Discharge and overflow; 2.4. Fountain codes and network code for sensor networks; 2.4.1. Impact of network coding on the degree distribution of an LT flow; 2.4.1.1. XOR network coding and LT code; 2.4.2. Design a network code for LT code"]
[{"$nulls":4},"2.4.2.1. Solutions of network coding2.4.3. Application to multihop "]
[{"$nulls":4},"sensor networks; 2.4.3.1. Multihop linear networks; 2.4.3.2. Sensor networks; 2.5. Conclusion; 2.6. Bibliography; Chapter 3. Switched Code for Ad Hoc Networks: Optimizing the Diffusion by Using Network Coding; 3.1. Abstract; 3.2. Introduction; 3.3. Diffusion in ad hoc networks; 3.4. Diffusion and network coding; 3.5. Switched code: incorporate erasure codes with network coding; 3.5.1. Definitions; 3.5.2. Coding function of switched code; 3.6. Decoding function of switched code; 3.7. Design and analysis of a new distribution"]
[{"$nulls":4},"3.7.1. Analysis of switched distribution3.8. Conclusion; 3.9. Bibliography; Chapter 4. Security by Network Coding; 4.1. Introduction; 4.2. Attack models; 4.2.1. A type-II wiretap network; 4.2.2. A nice but curious attacker; 4.3. Security for a wiretap network; 4.4. Algebraic security criteria; 4.4.1. Note on random linear network coding; 4.4.2. Algebraic security; 4.4.3. The algebraic security criterion; 4.4.4. Algorithmic application of the criterion; 4.5. Conclusion; 4.6. Bibliography; Chapter 5. Security for Network Coding; 5.1. Introduction; 5.2. Attack models; 5.2.1. Eavesdroppers"]
[{"$nulls":4},"5.2.1.1. Internal eavesdroppers5.2.1.2. External eavesdroppers; 5.2.2. Active attackers; 5.2.2.1. Pollution attacks; 5.2.2.2. Flooding attack; 5.2.3. Definition of homomorphic ciphering schemes; 5.2.3.1. Two specific schemes; 5.2.3.2. Completely homomorphic encryption schemes; 5.2.4. Homomorphic encryption and confidentiality in network coding; 5.2.4.1. The case of network coding using XOR; 5.2.4.2. The case of network coding in general; 5.3. Confidentiality; 5.3.1. Alternatives for confidentiality; 5.4. Integrity and authenticity solutions"]
[{"$nulls":4},"5.4.1. Definitions of homomorphic MAC and homomorphic hash functions"]
[null,null,null,"Sommario/riassunto","Network coding, a relatively new area of research, has evolved from the theoretical level to become a tool used to optimize the performance of communication networks - wired, cellular, ad hoc, etc. The idea consists of mixing \"packets\" of data together when routing them from source to destination. Since network coding increases the network performance, it becomes a tool to enhance the existing protocols and algorithms in a network or for applications such as peer-to-peer and TCP.This book delivers an understanding of network coding and provides a set of studies showing the improvement"]