نتایج جستجو برای: linear network coding
تعداد نتایج: 1226075 فیلتر نتایج به سال:
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
Performance Analysis of Physical Layer Network Coding
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called Main Problem of Subspace Coding is to determine the maximum size Aq(v, d) of a code in PG(v−1,Fq) with minimum subspace distance d. Here we completely resolve this problem for d ≥ v − 1. For d = v − 2 we present some improved bounds ...
In this paper, new equivalence relationships between a network code with link errors (NCLE) and an index code with side information errors (ICSIE) are studied. First, for a given network coding instance, the equivalent index coding instance is derived, where an NCLE is converted to the corresponding ICSIE and vice versa. Next, for a given index coding instance, the equivalent network coding ins...
Network coding provides a new perspective for anonymous communication. Wang et al. propose an anonymous communication scheme named ALNCode, in which the linear relation of the global encoding vectors can be hidden without the participation of encryption/decryption operations. But the effectiveness of the scheme needs to be further analyzed. In this paper, we present an exact formula of the effe...
URL: google " Baochun "
Most of the challenges in the creation of a publish/subscribe scheme is an effective delivery of message in bounded time and reliability of transmission. Because of the communication in WAN may be affected by the uncertain behavior of the network, in which messages can be lost or delayed. To enforces both reliability and timeliness in a publish/subscribe scheme requires two different approaches...
Recommended by Andrej Stefanov We characterize the average linear network coding throughput, T avg c , for the combination network with min-cut 2 over an arbitrary finite field. We also provide a network code, completely specified by the field size, achieving T avg c for the combination network.
We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate on most of the nodes (wireless links) of the network. With this rate selection, we give a value of the maximum achievable broadcast rate of the source: our central ...
The authors consider the problem of finding a minimum cost multicast sub-graph based on network coding, where delay values associated with each link, limited buffer-size of the intermediate nodes and link capacity variations over time are taken into account. The authors consider static multicast (where membership of the multicast group remains constant for the duration of the connection) in los...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید