Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 47.87
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
£ 47.86
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
PF. Condition: New.
£ 55.24
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
£ 44.22
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Best Price, Torrance, CA, U.S.A.
£ 42.03
Convert currencyQuantity: 1 available
Add to basketCondition: New. SUPER FAST SHIPPING.
£ 43.39
Convert currencyQuantity: Over 20 available
Add to basketKartoniert / Broschiert. Condition: New.
£ 52.65
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
£ 64.28
Convert currencyQuantity: 4 available
Add to basketCondition: New. pp. 116.
Published by Springer-Verlag New York Inc, 2014
ISBN 10: 1493905872 ISBN 13: 9781493905874
Language: English
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 120 pages. 9.25x6.00x0.25 inches. In Stock.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
£ 78.66
Convert currencyQuantity: 15 available
Add to basketCondition: New. 2014. 2014th Edition. paperback. . . . . .
Published by Springer-Verlag New York Inc., New York, 2014
ISBN 10: 1493905872 ISBN 13: 9781493905874
Language: English
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
£ 55.40
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: new. Paperback. 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. There are two main approaches in the theory of network error correction coding. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
£ 94.62
Convert currencyQuantity: 15 available
Add to basketCondition: New. 2014. 2014th Edition. paperback. . . . . . Books ship from the US and Ireland.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
£ 45.21
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Springer-Verlag New York Inc., New York, 2014
ISBN 10: 1493905872 ISBN 13: 9781493905874
Language: English
Seller: AussieBookSeller, Truganina, VIC, Australia
£ 122.73
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: new. Paperback. 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. There are two main approaches in the theory of network error correction coding. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Published by Springer-Verlag New York Inc., 2014
ISBN 10: 1493905872 ISBN 13: 9781493905874
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 56.89
Convert currencyQuantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 212.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 116 9 Illus.
Seller: Biblios, Frankfurt am main, HESSE, Germany
£ 70.48
Convert currencyQuantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 116.