Matroides Asociadas a Redes
Cargando...
Autores
Director
Tipo de contenido
Editor
Document language:
Español
Fecha
Título de la revista
ISSN de la revista
Título del volumen
Documentos PDF
Resumen
En este trabajo, se estudian las relaciones entre la Teoría de matroides y la Teoríıa de codificación de redes. Se define el matroide red sobre la estructura de los caminos independientes de un digrafo, el cual resulta ser representable [3]. Se establece la igualdad entre el matroide red y el matroide inducido por los códigos genéricos ([3] y [5]). Se establece la relación entre las redes matroidales y los códigos lineales escalares ([4]).
Abstract. In this paper we study the relations between Matroid theory and Net- work Coding Theory. Through the estructure of edge-disjoint paths, a single-source network is associated with a network matroid, which turns out to be representable([3]). A linear network code on an acyclic network assigns a coding vector to every edge. The linear independence among coding vectors naturally induces a matroid. It is shown that the induced matroid is the network matroid if the linear network code is generic([3] and [5]). We study matroidal networks and the relationship with scalar-lineary codes.
Abstract. In this paper we study the relations between Matroid theory and Net- work Coding Theory. Through the estructure of edge-disjoint paths, a single-source network is associated with a network matroid, which turns out to be representable([3]). A linear network code on an acyclic network assigns a coding vector to every edge. The linear independence among coding vectors naturally induces a matroid. It is shown that the induced matroid is the network matroid if the linear network code is generic([3] and [5]). We study matroidal networks and the relationship with scalar-lineary codes.