Network Coding and Subspace Designs

This book, written by experts from universities and major research laboratories, addresses the hot topic of network coding, a powerful scheme for information transmission in networks that yields near-optimal throughput. It introduces readers to this striking new approach to network coding, in which the network is not simply viewed as a mechanism for delivering packets, but rather an algebraic structure named the subspace, which these packets span. This leads to a new kind of coding theory, employing what are called subspace codes. The book presents selected, highly relevant advanced research output on: Subspace Codes and Rank Metric Codes; Finite Geometries and Subspace Designs; Application of Network Coding; Codes for Distributed Storage Systems. The outcomes reflect research conducted within the framework of the European COST Action IC1104: Random Network Coding and Designs over GF(q) . Taken together, they offer communications engineers, R&D engineers, researchers and graduate students in Mathematics, Computer Science, and Electrical Engineering a comprehensive reference guide to the construction of optimal network codes, as well as efficient encoding and decoding schemes for a given network code.

List of contents

Subspace Codes and Rank Metric Codes.- Finite Geometries and Subspace Designs.- Application of Network Coding.- Codes For Distributed Storage Systems.

Summary

This book, written by experts from universities and major research laboratories, addresses the hot topic of network coding, a powerful scheme for information transmission in networks that yields near-optimal throughput. It introduces readers to this striking new approach to network coding, in which the network is not simply viewed as a mechanism for delivering packets, but rather an algebraic structure named the subspace, which these packets span. This leads to a new kind of coding theory, employing what are called subspace codes. The book presents selected, highly relevant advanced research output on: Subspace Codes and Rank Metric Codes; Finite Geometries and Subspace Designs; Application of Network Coding; Codes for Distributed Storage Systems. The outcomes reflect research conducted within the framework of the European COST Action IC1104: Random Network Coding and Designs over GF(q). Taken together, they offer communications engineers, R&D engineers, researchers and graduate students in Mathematics, Computer Science, and Electrical Engineering a comprehensive reference guide to the construction of optimal network codes, as well as efficient encoding and decoding schemes for a given network code.

Product details

• Assisted by: Marcus Greferath (Editor), Mari Osvin Pavcevic (Editor), Mario Osvin Pavcevic (Editor), Mario Osvin Pav¿evi¿ (Editor), Mario Osvin Pavcevic (Editor), Mario Osvin Pavčević (Editor), Natalia Silberstein (Editor), Natalia Silberstein et al (Editor), María Ángeles Vázquez-Castro (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Hardback
• Released: 31.03.2018
• EAN: 9783319702926
• ISBN: 978-3-31-970292-6
• No. of pages: 442
• Dimensions: 159 mm x 241 mm x 31 mm
• Weight: 834 g
• Illustrations: XIV, 442 p. 57 illus., 32 illus. in color.
• Series: Signals and Communication Technology; Signals and Communication Technology
• Subjects: Natural sciences, medicine, IT, technology > Technology > Electronics, electrical engineering, communications engineering; B, Kodierungstheorie und Verschlüsselung (Kryptologie), Diskrete Mathematik, Data Warehousing, Informationsrückgewinnung, Information Retrieval, Informationstheorie, Information Retrieval, engineering, Electrical Engineering, Combinatorics, Communications Engineering, Networks, Discrete Mathematics, Combinatorics & graph theory, Coding and Information Theory, Information theory, Coding theory & cryptology, Coding theory, Information Storage and Retrieval