0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (1)
  • -
Status
Brand

Showing 1 - 1 of 1 matches in All Departments

Linear Network Error Correction Coding (Paperback, 2014 ed.): Xuan Guang, Zhen Zhang Linear Network Error Correction Coding (Paperback, 2014 ed.)
Xuan Guang, Zhen Zhang
R1,828 Discovery Miles 18 280 Ships in 10 - 15 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Loot
Nadine Gordimer Paperback  (2)
R205 R168 Discovery Miles 1 680
Home Classix Trusty Traveller Mug…
R99 R81 Discovery Miles 810
Microsoft Xbox Series X Console (1TB)
 (21)
R14,999 Discovery Miles 149 990
Alcolin Cold Glue (500ml)
R128 R101 Discovery Miles 1 010
First Dutch Brands Wire Wall Basket With…
R110 Discovery Miles 1 100
Microsoft Xbox Series Wireless…
R1,699 R1,589 Discovery Miles 15 890
Casals 22 Piece Steel Hand Tool Set…
 (1)
R399 Discovery Miles 3 990
Loot
Nadine Gordimer Paperback  (2)
R205 R168 Discovery Miles 1 680
ZA Cute Puppy Love Paw Set (Necklace…
R712 R499 Discovery Miles 4 990
Joseph Joseph Index Mini (Graphite)
R642 Discovery Miles 6 420

 

Partners