49 research outputs found

    Linear Fractional Network Coding and Representable Discrete Polymatroids

    Full text link
    A linear Fractional Network Coding (FNC) solution over Fq\mathbb{F}_q is a linear network coding solution over Fq\mathbb{F}_q in which the message dimensions need not necessarily be the same and need not be the same as the edge vector dimension. Scalar linear network coding, vector linear network coding are special cases of linear FNC. In this paper, we establish the connection between the existence of a linear FNC solution for a network over Fq\mathbb{F}_q and the representability over Fq\mathbb{F}_q of discrete polymatroids, which are the multi-set analogue of matroids. All previously known results on the connection between the scalar and vector linear solvability of networks and representations of matroids and discrete polymatroids follow as special cases. An algorithm is provided to construct networks which admit FNC solution over Fq,\mathbb{F}_q, from discrete polymatroids representable over Fq.\mathbb{F}_q. Example networks constructed from discrete polymatroids using the algorithm are provided, which do not admit any scalar and vector solution, and for which FNC solutions with the message dimensions being different provide a larger throughput than FNC solutions with the message dimensions being equal.Comment: 8 pages, 5 figures, 2 tables. arXiv admin note: substantial text overlap with arXiv:1301.300

    Linear Network Coding, Linear Index Coding and Representable Discrete Polymatroids

    Full text link
    Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding and representable discrete polymatroids. We consider vector linear solutions of networks over a field Fq,\mathbb{F}_q, with possibly different message and edge vector dimensions, which are referred to as linear fractional solutions. We define a \textit{discrete polymatroidal} network and show that a linear fractional solution over a field Fq,\mathbb{F}_q, exists for a network if and only if the network is discrete polymatroidal with respect to a discrete polymatroid representable over Fq.\mathbb{F}_q. An algorithm to construct networks starting from certain class of discrete polymatroids is provided. Every representation over Fq\mathbb{F}_q for the discrete polymatroid, results in a linear fractional solution over Fq\mathbb{F}_q for the constructed network. Next, we consider the index coding problem and show that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a \textit{perfect linear index coding solution} for an index coding problem obtained from that matroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.Comment: 24 pages, 6 figures, 4 tables, some sections reorganized, Section VI newly added, accepted for publication in IEEE Transactions on Information Theor

    On the representability of integer polymatroids: Applications in linear code construction

    Get PDF
    It has been shown that there is a duality between the linear network coding solution and the entropic vectors induced by collection of subspaces in a vector space over a finite field (dubbed linearly constructed entropic vectors). The region of all linearly constructed vectors, coincides with the set of all representable polymatroids. For any integer polymatroid, there is an associated matroid, which uniquely identifies the polymatroid. We conjecture that the representability of the underlying matroid is a sufficient condition for integer polymatroids to be linearly representable. We prove that the conjecture holds for representation over real numbers. Furthermore, we show that any real-valued submodular function (such as Shannon entropy) can be approximated (arbitrarily close) by an integer polymatroid

    Quasi-linear Network Coding

    Full text link
    We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and then quantizing it to a vector non-linear network code using a fixed-point representation. Apart from describing the method, we draw some links between some network parameters and the rate of the resulting code
    corecore