cam a22 5 4500 317155679 CHVBK 20201009192931.0 m d cr |n |||||||| 140625s2014 xxu|||| s 0 0|eng d 978-1-4939-0588-1 978-1-4939-0587-4 (print) 10.1007/978-1-4939-0588-1 doi (SERSOL)ssj0001186543 (IDSSG)000655386 (WaSeSS)ssj0001186543 WaSeSS TK5105.5-5105.9 UKN bicssc COM075000 bisacsh 004.6 23 CH001A98EA4C312BBD111C1257F0700701850 iCapture Guang Xuan author Linear Network Error Correction Coding [Elektronische Daten] by Xuan Guang, Zhen Zhang New York, NY Springer New York Imprint: Springer 2014 1 online resource (VI, 107 p. 9 illus.) online resource text file PDF rda SpringerBriefs in Computer Science 2191-5768 Introduction -- Network Error Correction Model -- Another Description of Linear Network Error Correction Model -- Coding Bounds of Linear Network Error Correction Codes -- Random Linear Network Error Correction Coding -- Subspace Codes. Lizenzbedingungen können den Zugang einschränken. License restrictions may limit access. There are two main approaches in the theory of network error correction coding. In this SpringerBrief, the authors summarize some of the most important contributions following the classic approach, which represents messages by sequencessimilar to algebraic coding,and also briefly discuss the main results following theother approach,that uses the theory of rank metric codes for network error correction of representing messages by subspaces. This book starts by establishing the basic linear network error correction (LNEC) model and then characterizes two equivalent descriptions. Distances and weights are defined in order to characterize the discrepancy of these two vectors and to measure the seriousness of errors. Similar to classical error-correcting codes, the authors also apply the minimum distance decoding principle to LNEC codes at each sink node, but use distinct distances. For this decoding principle, it is shown that the minimum distance of a LNEC code at each sink node can fully characterize its error-detecting, error-correcting and erasure-error-correcting capabilities with respect to the sink node. In addition, some important and useful coding bounds in classical coding theory are generalized to linear network error correction coding, including the Hamming bound, the Gilbert-Varshamov bound and the Singleton bound. Several constructive algorithms of LNEC codes are presented, particularly for LNEC MDS codes, along with an analysis of their performance. Random linear network error correction coding is feasible for noncoherent networks with errors. Its performance is investigated by estimating upper bounds on some failure probabilities by analyzing the information transmission and error correction. Finally, the basic theory of subspace codes is introduced including the encoding and decoding principle as well as the channel model, the bounds on subspace codes, code construction and decoding algorithms. Computer science Computer Communication Networks Coding theory Zhang Zhen author SpringerLink (Online service) Printed edition 9781493905874 https://link.springer.com/10.1007/978-1-4939-0588-1 Uni Basel: Volltext BK020053 XK020053 XK020000 Springer Computer Science eBooks 2014 English/International E-Books von 360MarcUpdates noalma ids I IDSSG HSG HSG ONL HONL000655386 IDSBB A145 A145 145VT IDSBB 100 1- Guang Xuan author IDSBB 490 1- SpringerBriefs in Computer Science 2191-5768 IDSBB 700 1- Zhang Zhen author IDSBB 710 2- SpringerLink (Online service) IDSBB 776 08 Printed edition 9781493905874 IDSBB 856 40 https://link.springer.com/10.1007/978-1-4939-0588-1 Uni Basel: Volltext IDSSG 490 0- SpringerBriefs in Computer Science IDSSG 700 1- Guang Xuan IDSSG 700 1- Zhang Zhen IDSSG 856 4- https://doi.org/10.1007/978-1-4939-0588-1 Full text for the University of St. Gallen SWISSBIB 317155679