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.

Table des matières

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

Résumé

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.

Détails du produit

• Collaboration: Marcus Greferath (Editeur), Mari Osvin Pavcevic (Editeur), Mario Osvin Pavcevic (Editeur), Mario Osvin Pavcevic (Editeur), Mario Osvin Pavčević (Editeur), Natalia Silberstein (Editeur), Natalia Silberstein et al (Editeur), María Ángeles Vázquez-Castro (Editeur)
• Edition: Springer, Berlin
• Langues: Anglais
• Format d'édition: Livre de poche
• Sortie: 01.01.2019
• EAN: 9783319889177
• ISBN: 978-3-31-988917-7
• Pages: 442
• Dimensions: 155 mm x 236 mm x 26 mm
• Poids: 702 g
• Illustrations: XIV, 442 p. 57 illus., 32 illus. in color.
• Thèmes: Signals and Communication Technology; Signals and Communication Technology
• Catégories: Sciences naturelles, médecine, informatique, technique > Technique > Electronique, électrotechnique, technique de l'information; 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