عنوان

Linear network error correction coding /

شابک

1306699967

شابک

1493905880 (electronic bk.)

شابک

9781306699969

شابک

9781493905881 (electronic bk.)

شابک اشتباه

1493905872 (print)

شابک اشتباه

9781493905874

شابک اشتباه

9781493905874 (print)

شماره

dltt

عنوان اصلي

Linear network error correction coding /

نام عام مواد

[Book]

نام نخستين پديدآور

Xuan Guang, Zhen Zhang

نام خاص و کميت اثر

1 online resource.

عنوان فروست

SpringerBriefs in computer science

متن يادداشت

Includes bibliographical references

متن يادداشت

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

متن يادداشت

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

شماره استاندارد بين المللي کتاب و موسيقي

9781493905874

شماره استاندارد بين المللي کتاب و موسيقي

9781493905881

موضوع مستند نشده

Error-correcting codes (Information theory)

موضوع مستند نشده

Linear programming.

موضوع مستند نشده

MAT-- 003000

موضوع مستند نشده

MAT-- 029000

شماره

ويراست

شماره رده

مستند نام اشخاص تاييد نشده

Guang, Xuan

مستند نام اشخاص تاييد نشده

Zhang, Zhen

مستند نام تنالگان تاييد نشده

Ohio Library and Information Network.

تاريخ عمليات

20201222074619.0

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

کد کاربرگه

270410

تكميل شده

Y