Network Coding and Subspace Designs


Book Description

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.




Network Coding and Subspace Designs


Book Description

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.




Combinatorics and Finite Fields


Book Description

Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory. This book contains survey articles on topics such as difference sets, polynomials, and pseudorandomness.




Network Coding


Book Description

Network coding, a relatively new area of research, has evolved from the theoretical level to become a tool used to optimize the performance of communication networks – wired, cellular, ad hoc, etc. The idea consists of mixing “packets” of data together when routing them from source to destination. Since network coding increases the network performance, it becomes a tool to enhance the existing protocols and algorithms in a network or for applications such as peer-to-peer and TCP. This book delivers an understanding of network coding and provides a set of studies showing the improvements in security, capacity and performance of fixed and mobile networks. This is increasingly topical as industry is increasingly becoming more reliant upon and applying network coding in multiple applications. Many cases where network coding is used in routing, physical layer, security, flooding, error correction, optimization and relaying are given – all of which are key areas of interest. Network Coding is the ideal resource for university students studying coding, and researchers and practitioners in sectors of all industries where digital communication and its application needs to be correctly understood and implemented. Contents 1. Network Coding: From Theory to Practice, Youghourta Benfattoum, Steven Martin and Khaldoun Al Agha. 2. Fountain Codes and Network Coding for WSNs, Anya Apavatjrut, Claire Goursaud, Katia Jaffrès-Runser and Jean-Marie Gorce. 3. Switched Code for Ad Hoc Networks: Optimizing the Diffusion by Using Network Coding, Nour Kadi and Khaldoun Al Agha. 4. Security by Network Coding, Katia Jaffrès-Runser and Cédric Lauradoux. 5. Security for Network Coding, Marine Minier, Yuanyuan Zhang and Wassim Znaïdi. 6. Random Network Coding and Matroids, Maximilien Gadouleau. 7. Joint Network-Channel Coding for the Semi-Orthogonal MARC: Theoretical Bounds and Practical Design, Atoosa Hatefi, Antoine O. Berthet and Raphael Visoz. 8. Robust Network Coding, Lana Iwaza, Marco Di Renzo and Michel Kieffer. 9. Flow Models and Optimization for Network Coding, Eric Gourdin and Jeremiah Edwards.




Concise Encyclopedia of Coding Theory


Book Description

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry. Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references. The book is divided into three parts: Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography. Features Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research







Essays on Coding Theory


Book Description

Critical coding techniques have developed over the past few decades for data storage, retrieval and transmission systems, yet they are rarely covered in the graduate curricula. This book provides new researchers in academia and industry with informal introductions to the basic ideas of these topics, including pointers to further reading.




Network Coding Applications


Book Description

Network Coding Applications looks at how ideas from network coding can have an impact on a number of new applications. It explains what network coding is, explores what its benefits are, and how much it costs to design and operate networks implementing network coding




An Exploration of Proposed Algorithms for Use Over the Subspace Metric in the Scope of Network Coding Theory


Book Description

The field of network coding has contributed to the advancement of computer networking, transmission of wireless networks, and more. The subspace metric has recently been a measure of interest for network coding with algorithms being a point of intrigue. This paper will propose encoding and decoding algorithms with the goal that it will provide a foundation for how coding can be done over this metric and provide a path for how to optimize these for the future. The proposed algorithms will be implemented and their results will be presented and analyzed in an attempt to determine the types of algorithms that will be most efficient.




Combinatorial Algorithms


Book Description

This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.