相关论文: Bounds for flag codes
This paper introduces a novel algorithm for cardinality, i.e., the number of nodes, estimation in large scale anonymous graphs using statistical inference methods. Applications of this work include estimating the number of sensor devices,…
Several upper bounds on the size of quantum codes are derived using the linear programming approach. These bounds are strengthened for the linear quantum codes.
The millimeter-wave bands have been attracting significant interest as a means to achieve major improvements in data rates and network efficiencies. One significant limitation for use of the millimeter-wave bands for cellular communication…
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters…
In this paper, we study flag codes on the vector space $\mathbb{F}_q^n$, being $q$ a prime power and $\mathbb{F}_q$ the finite field of $q$ elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum…
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…
Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.
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…
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers…
Frameproof codes are a class of secure codes that were originally introduced in the pioneering work of Boneh and Shaw in the context of digital fingerprinting. They can be used to enhance the security and credibility of digital content. Let…
The fundamental limit of coded caching is investigated for the case with $N=3$ files and $K=3$ users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of…
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However,…
We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical ${\rm AC}^0$. Among others, we derive such a lower bound for all fpt-approximations of the parameterized clique problem and…
Given a correlation generated by a (possibly quantum) communication network, we study the amount of shared randomness required to generate it. We develop a novel upper bound for approximating distributions generated by arbitrary networks…