18 papers · ranked by Valyu relevance
Christopher Hojny, Altan B. Kilic, Alberto Ravagnani
—We consider the problem of computing the capacity of a coded, multicast network over a small alphabet. We introduce a novel approach to this problem based on mixedinteger programming. As an application of our approach, we recover, extend and refine various results that were previously obtained with case-by-case…
Nadim Ghaddar, Shouvik Ganguly, Lele Wang, Young-Han Kim
—Coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that the point-to-point codes satisfy certain properties pertaining to the rate, the error probability, and the distribution of decoded sequences…
Shenghao Yang, Kenneth W. Shum
Around the year 2000, network coding introduced the concept that coding can replace the basic packet forwarding operation used in traditional network communication systems [1,2,3]. This innovation simplified the achievement of maximum communication rates for unicast and improved the maximum communication rates for…
Baoxing PU
For a special class of three unicast sessions, in which the maximum flow from each sender to each receiver is the same positive integer k, a network coding approach is proposed. A multigeneration mixed strategy, in which (2 × n + 1) consecutive generations are taken as a mixed set, is adopted. The precoding strategy is…
Ben Grinboim, Itay Shrem, Ofer Amrani
Increasing network utilization is often considered as the holy grail of communications. In this article, the concept of subrate coding and decoding in the framework of linear network coding (LNC) is disscussed for single-source multiple-sinks finite acyclic networks. Sub-rate coding offers an add-on to existing LNC. It…
Licheng Mao, Shenghao Yang, Xuan Huang, Yanyan Dong + 1 more
Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may significantly reduce the number of message packets received by the…
Bin Fan, Bin Tang, Zhihao Qu, Baoliu Ye + 1 more
In wireless distributed computing systems, worker nodes connect to a master node wirelessly and perform large-scale computational tasks that are parallelized across them. However, the common phenomenon of straggling (i.e., worker nodes often experience unpredictable slowdown during computation and communication) and…
Assist. Prof. Dr. Hazem I. Ali, Qutaiba I. Ali
— Software Defined Networking or SDN is an architectural approach to managing the network where the control and forwarding are different planes that are controlled through an application interface. Nevertheless, SDN's traditional renditions incorporate a few limitations such as packet drops, higher latency and…
Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou, Lily M. L. Yung + 2 more
'Ka Hei Ng' 'Boris Ryabko'] Multi-hop networks have become popular network topologies in various emerging Internet of Things (IoT) applications. Batched network coding (BNC) is a solution to reliable communications in such networks with packet loss. By grouping packets into small batches and restricting recoding to the…
Qinbin Zhou, Taotao Zhao, Xiaomin Chen, Yuesheng Zhong + 2 more
Driven by the emerging mission-critical and data-intensive applications in industrial intelligent manufacturing, the software-defined network (SDN) based fiber-wireless access network (FiWi) is attracting considerable attention thanks to its capability of central control and large bandwidth. However, the heterogeneity…
Vipindev Adat Vasudevan, Tarun Kumar Soni, Muriel Médard
—Network coding has been widely used as a technology to ensure efficient and reliable communication. The ability to recode packets at the intermediate nodes is a major benefit of network coding implementations. This allows the intermediate nodes to choose a different code rate and fine-tune the outgoing transmission to…
Xuan Guang, Jihang Yang, Ruze Zhang
We consider uniquely-decodable coding for zero-error network function computation, where in a directed acyclic graph, the single sink node is required to compute with zero error a target function multiple times, whose arguments are the information sources generated at a set of source nodes. We are interested in the…
Paul Züge, Raoul-Martin Memmesheimer
A hallmark of biological and artificial neural networks is that neurons tile the range of continuous sensory inputs and intrinsic variables with overlapping responses. It is characteristic for the underlying recurrent connectivity in the cortex that neurons with similar tuning predominantly excite each other. The…
Karla Ivankovic, Anastasios Dimou, Justo Montoya-Gálvez, Riccardo Zucca + 2 more
Understanding how the brain represents information is a central challenge in neuroscience and a practical bottleneck for brain-computer interfaces. Existing analytical tools cannot identify neural representations directly from neural activity data. We introduce MultiPEC, a data-driven method that discovers neural…
Fajia Sun, Long Qian
DNA has been pursued as a compelling medium for digital data storage during the past decade. While large-scale data storage and random access have been achieved in artificial DNA, the synthesis cost keeps hindering DNA data storage from popularizing into daily life. In this study, we proposed a more efficient paradigm…
Jia Lu, Ryan Tsoi, Nan Luo, Yuanchi Ha + 8 more
Dynamical systems often generate distinct outputs according to different initial conditions, and one can infer the corresponding input configuration given an output. This property captures the essence of information encoding and decoding. Here, we demonstrate the use of self-organized patterns, combined with machine…
Matthew Bailey, Mark Wilson
One of the critical tools of persistent homology is the persistence diagram. We demonstrate the applicability of a persistence diagram showing the existence of topological features (here rings in a 2D network) generated over time instead of space as a tool to analyse trajectories of biological networks. We show how the…
Andrew Stokely, Lane Votapka, Marcus Hock, Abigail Teitgen + 3 more
We present the Netsci program - an open-source scientific software package that leverages GPU acceleration and a k-nearest-neighbor algorithm in order to estimate the mutual information (MI) between data in a set. The GPU acceleration presented here, as an improvement upon existing estimators, enables calculation…