| 书目名称 | Linear Network Error Correction Coding | | 编辑 | Xuan Guang,Zhen Zhang | | 视频video | | | 概述 | Includes supplementary material: | | 丛书名称 | SpringerBriefs in Computer Science | | 图书封面 |  | | 描述 | 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 sequences similar to algebraic coding, and also briefly discuss the main results following the other 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 codin | | 出版日期 | Book 2014 | | 关键词 | Attacks from malicious nodes; decoding algorithms; erasures; error correction capability; maximum distan | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4939-0588-1 | | isbn_softcover | 978-1-4939-0587-4 | | isbn_ebook | 978-1-4939-0588-1Series ISSN 2191-5768 Series E-ISSN 2191-5776 | | issn_series | 2191-5768 | | copyright | The Author(s) 2014 |
The information of publication is updating
|
|
发表于 2025-3-21 19:07:31
