Linear Programming Problems in Network Coding and Closure Operators via Partitions

• Autores: Peña-Macias, Victor, Sarria, Humberto
• Formato: artículo
• Fecha de Publicación: 2019
• Institución: Universidad Nacional de Trujillo
• Repositorio: Revistas - Universidad Nacional de Trujillo
• Lenguaje: español
• OAI Identifier: oai:ojs.revistas.unitru.edu.pe:article/2633
• Enlace del recurso: https://revistas.unitru.edu.pe/index.php/SSMM/article/view/2633
• Nivel de acceso: acceso abierto
• Materia: Directed graph; network code; closure operator; representable matroid; linear rank inequality; Grafo dirigido; código de red; operador de clausura; matroide representable; desigualdad rango lineal

A network is an acyclic directed graph in which there are sources that have some messages and want to transmit to receivers through the combination of messages in intermediate nodes. The goal is to find a collection of functions that allow to combine messages in order to satisfy the demand of the receivers. In this paper, we study the fractional solvability problem of a network using an extension of the solvability problem in closure operators given by Gadouleau in 2013. We define linear programming problems via the desired extension in order to study capacities; using some information inequalities and characteristic-dependent linear rank inequalities, we obtain upper bounds on linear capacity of some networks and closure operators over some fields.