In this paper we present a novel coding approach to deal with the transmission of
information over a network. In particular we make use of the network several times (multi …

Maximum distance profile codes over finite nonbinary fields have been introduced and
thoroughly studied in the last decade. These codes have the property that their column …

The approach to convolutional codes from the linear systems point of view provides us with
effective tools in order to construct convolutional codes with adequate properties that let us …

Abstract Let FDFD be the polynomial ring with entries in a finite field F F. Convolutional
codes are submodules of FD^ n FD n that can be described by left prime polynomial …

Noncatastrophic encoders are an important class of polynomial generator matrices of
convolutional codes. When these polynomials have coefficients in a finite field, these …

An important class of codes widely used in applications is the class of convolutional codes.
Most of the literature of convolutional codes is devoted to convolutional codes over finite …

The seminal paper of Koetter and Kschischang [11] introduced coding concepts for errors
and erasures in a random network coding setting and since then has opened a major …

In this work, we analyze the problem of catastrophicity of encoders of convolutional codes
over the Laurent series with coefficients in ℤ pr, ℤ pr ((d)). Kuijper and Pinto proved in [M …

In this paper, we develop the theory of convolutional codes over finite commutative chain
rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and …

Nesta tese consideramos códigos convolucionais sobre o anel polinomial [] rp′ D, onde p
é primo er é um inteiro positivo. Em particular, focamo-nos no conjunto das palavras de …