相关论文: Multicast Triangular Semilattice Network
This work considers the multiple-access multicast error-correction scenario over a packetized network with $z$ malicious edge adversaries. The network has min-cut $m$ and packets of length $\ell$, and each sink demands all information from…
We consider a lossy multicast network in which the reliability is provided by means of Random Linear Network Coding. Our goal is to characterise the performance of such network in terms of the probability that a source message is delivered…
The formalism of the scattering matrix is applied to describe the transmission properties of multilayered structures with deep variations of the refractive index and arbitrary arrangements of the layers. We show that there is an exact…
The index coding problem is studied from an interference alignment perspective, providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between multiple unicast…
We study the capacity regions of broadcast channels with binary inputs and symmetric outputs. We study the partial order induced by the more capable ordering of broadcast channels for channels belonging to this class. This study leads to…
Networks provide a popular representation of complex data. Often, different types of relational measurements are taken on the same subjects. Such data can be represented as a \textit{multislice network}, a collection of networks on the same…
This paper considers vector network coding based on rank-metric codes and subspace codes. Our main result is that vector network coding can significantly reduce the required field size compared to scalar linear network coding in the same…
The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a…
Quantum networks offer a realistic and practical scheme for generating multiparticle entanglement and implementing multiparticle quantum communication protocols. However, the correlations that can be generated in networks with quantum…
This paper examines the problem of rate allocation for multicasting over slow Rayleigh fading channels using network coding. In the proposed model, the network is treated as a collection of Rayleigh fading multiple access channels. In this…
We describe optimal robust algorithms for finding a triangle and the unweighted girth in a unit disk graph, as well as finding a triangle in a transmission graph.In the robust setting, the input is not given as a set of sites in the plane,…
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…
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
Due to their numerous advantages, communications over multicarrier schemes constitute an appealing approach for broadband wireless systems. Especially, the strong penetration of orthogonal frequency division multiplexing (OFDM) into the…
A connected graph is called a multi-block graph if each of its blocks is a complete multi-partite graph. Building on the work of \cite{Bp3,Hou3}, we compute the determinant and inverse of the distance matrix for a class of multi-block…
This article presents a theoretical investigation of generalized encoded forms of networks in a uniform multidimensional space. First, we study encoded networks with (finite) arbitrary node dimensions (or aspects), such as time instants or…
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e., types of layering). In developing this generalization, we identify multiple types of isomorphisms. For example, in multilayer networks…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…