Linear Network Error Correction Coding (Record no. 57412)

000 -LEADER
fixed length control field 03778nam a22004815i 4500
001 - CONTROL NUMBER
control field 978-1-4939-0588-1
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421112221.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 140321s2014 xxu| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781493905881
-- 978-1-4939-0588-1
082 04 - CLASSIFICATION NUMBER
Call Number 004.6
100 1# - AUTHOR NAME
Author Guang, Xuan.
245 10 - TITLE STATEMENT
Title Linear Network Error Correction Coding
300 ## - PHYSICAL DESCRIPTION
Number of Pages VI, 107 p. 9 illus.
490 1# - SERIES STATEMENT
Series statement SpringerBriefs in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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.
520 ## - SUMMARY, ETC.
Summary, etc 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 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.
700 1# - AUTHOR 2
Author 2 Zhang, Zhen.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-1-4939-0588-1
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- New York, NY :
-- Springer New York :
-- Imprint: Springer,
-- 2014.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer communication systems.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Coding theory.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Coding and Information Theory.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2191-5768
912 ## -
-- ZDB-2-SCS

No items available.