Linear network codes and algebraic curves

In this thesis, we consider a particular type of error-correcting codes, named Random Network Codes (or simply Network Codes). As the name suggests, these codes are born in the context of networks, which is vehicle of informations most used nowadays. These codes are a generalization of classical linear codes and permit to send information into a noisy network. We analyze the theory of network codes and we propose new constructions of such codes using algebraic curves.