عنوان

Linear network error correction coding /

(Number (ISBN

1306699967

(Number (ISBN

1493905880 (electronic bk.)

(Number (ISBN

9781306699969

(Number (ISBN

9781493905881 (electronic bk.)

Erroneous ISBN

1493905872 (print)

Erroneous ISBN

9781493905874

Erroneous ISBN

9781493905874 (print)

Number

dltt

Title Proper

Linear network error correction coding /

General Material Designation

[Book]

First Statement of Responsibility

Xuan Guang, Zhen Zhang

Specific Material Designation and Extent of Item

1 online resource.

Series Title

SpringerBriefs in computer science

Text of Note

Includes bibliographical references

Text of Note

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

0

Text of Note

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

International Standard Book Number

9781493905874

International Standard Book Number

9781493905881

Error-correcting codes (Information theory)

Linear programming.

MAT-- 003000

MAT-- 029000

Number

Edition

Class number

Guang, Xuan

Zhang, Zhen

Ohio Library and Information Network.

Date of Transaction

20201222074619.0

Cataloguing Rules (Descriptive Conventions))

pn

Electronic name

[Book]

270410

Y