相关论文: Generalized Interlinked Cycle Cover for Index Codi…
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the vertex set V into r acyclic sets. The dichromatic number of a directed graph G is the smallest r such that G allows an acyclic r-coloring. For symmetric digraphs the…
The length of an optimal scalar linear index code of a groupcast index coding problem is equal to the minrank of its side information hypergraph. The side-information hypergraph becomes a side-information graph for a special class of…
Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges,…
We study the fundamental problem of index coding under an additional privacy constraint that requires each receiver to learn nothing more about the collection of messages beyond its demanded messages from the server and what is available to…
This paper considers the problem of network coding for multiple unicast connections in networks represented by directed acyclic graphs. The concept of interference alignment, traditionally used in interference networks, is extended to…
A single unicast index coding problem (SUICP) is called symmetric neighboring and consecutive (SNC) side-information problem if it has $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having…
In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications, the data to be transmitted may lie (or can be well approximated) in a…
Cycles are fundamental elements in graph-structured data and have demonstrated their effectiveness in enhancing graph learning models. To encode such information into a graph learning framework, prior works often extract a summary quantity,…
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the…
This paper investigates the theoretical analysis of intrinsic message passing decoding for generalized product codes (GPCs) with irregular degree distributions, a generalization of product codes that allows every code bit to be protected by…
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay…
Unsupervised (or self-supervised) graph representation learning is essential to facilitate various graph data mining tasks when external supervision is unavailable. The challenge is to encode the information about the graph structure and…
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…
The design of zero-delay Joint Source-Channel Coding (JSCC) schemes for the transmission of correlated information over fading Multiple Access Channels (MACs) is an interesting problem for many communication scenarios like Wireless Sensor…
This work studies linear interference networks, both wired and wireless, with no channel state information at the transmitters (CSIT) except a coarse knowledge of the end-to-end one-hop topology of the network that only allows a distinction…
We study zero-error unicast index-coding instances, where each receiver must perfectly decode its requested message set, and the message sets requested by any two receivers do not overlap. We show that for all these instances with up to…
A new precoding-based intersession network coding (NC) scheme has recently been proposed, which applies the interference alignment technique, originally devised for wireless interference channels, to the 3-unicast problem of directed…
In the index coding problem a sender holds a message $x \in \{0,1\}^n$ and wishes to broadcast information to $n$ receivers in a way that enables the $i$th receiver to retrieve the $i$th bit $x_i$. Every receiver has prior side information…
Network coding is a new technique to transmit data through a network by letting the intermediate nodes combine the packets they receive. Given a network, the network coding solvability problem decides whether all the packets requested by…
In this paper we define critical graphs as minimal graphs that support a given set of rates for the index coding problem, and study them for both the one-shot and asymptotic setups. For the case of equal rates, we find the critical graph…