Random Network Coding and Matroids
Maximilien Gadouleau · 2012
This chapter focuses on different models for transmitting data by non-coherent network coding. It examines the three protocols for non-coherent communications such as routing, random linear network coding and random affine network coding. The chapter reviews the definition and essential properties of matroids and their flats. A matroid can contain loops and parallel elements. The transmission model is very general and provides a unified approach for distinct problems such as store and forward (SAF), random linear network coding (RLNC) and random affine network coding (RANC). The matroid-based model also allows us to consider techniques for correcting errors when the network is not perfect. Controlled Vocabulary Terms network coding; transmission networks