It is shown that the error correction problem in random network coding is closely related to a generalized decoding problem for rank-metric codes. This result enables many of the rich tools devised for the rank metric...
详细信息
ISBN:
(纸本)9781424413973
It is shown that the error correction problem in random network coding is closely related to a generalized decoding problem for rank-metric codes. This result enables many of the rich tools devised for the rank metric to be naturally applied to random network coding. The generalized decoding problem introduced in this paper allows partial information about the error to be supplied. This partial information can be either in the form of erasures (knowledge of an error location but not its value) or deviations (knowledge of an error value but not its location). For Gabidulin codes, an efficient decoding algorithm is proposed that can correct e errors, mu erasures and v deviations, provided 2isin + mu + v les d - 1, where d is the minimum distance of the code.
We introduce a centralized joint network-channel coding scheme for maximized throughput and increased robustness against link failure in a communication network. We introduce RNC1(h,k) to multicast k independent d...
详细信息
We introduce a centralized joint network-channel coding scheme for maximized throughput and increased robustness against link failure in a communication network. We introduce RNC1(h,k) to multicast k independent data in a directed and acyclic network with capacity h , k ≤ h . The redundancy through path diversity increases the resistance of the network against link failure. An improved version of RNC1 , RNC1(h,k) , is introduced to guarantee the rate k for h-k flow failures. The proposed schemes exploit the network structure for code design, which results in a manageable design complexity.
Motivated by the fact that the most problems on network coding can be represented as how much information about a given subset of network inputs can be obtained by legal or illegal users from the channels accessed by ...
详细信息
Motivated by the fact that the most problems on network coding can be represented as how much information about a given subset of network inputs can be obtained by legal or illegal users from the channels accessed by them, in this paper we investigate the relation between a subset of random network inputs and the outputs of an arbitrarily given set of channels in networks. We focus on linear network codes because they are widely studied and applied. We begin with the algebraic structure of cosets of linear subspaces and derive bounds on their mutual information and the conditions for their tightness. To apply the results to random linear network coding we introduce strongly generic linear network codes such that for sufficiently large coding fields a random linear network code is strongly generic with high probability. Our results show that random linear network coding is good for error correction and security but not efficient for multiple source network coding.
The interaction between cooperation and network coding has lately received a significant deal of attention, as a combination of the two brings novelty, flexibility and improved performance. However, there is a lack of...
详细信息
The interaction between cooperation and network coding has lately received a significant deal of attention, as a combination of the two brings novelty, flexibility and improved performance. However, there is a lack of studies about real-world scenarios. In this paper, we analyze the performance of an existing cooperative-NC protocol for clustered networks, where all nodes connect in a single hop fashion to a cluster head. This is representative of environments like WLANs, mesh networks, last mile connectivity or ad hoc networks where some nodes create an infrastructure for the others. We show that our system is able to improve network throughput by as much as 15% and network capacity by 20% over decode-and-forward cooperative protocols.
We consider a cognitive radio network where primary users (PUs) employ network coding for data transmissions. We view network coding as a spectrum shaper, in the sense that it increases spectrum availability to second...
详细信息
We consider a cognitive radio network where primary users (PUs) employ network coding for data transmissions. We view network coding as a spectrum shaper, in the sense that it increases spectrum availability to secondary users (SUs) and offers more structure of spectrum holes, which in turn improves the predictability of the primary spectrum. With this spectrum shaping effect of network coding, each SU can carry out adaptive channel sensing by dynamically updating the list of the (predicted) idle PU channels and giving priority to these channels for spectrum sensing. This dynamic spectrum access approach with network coding improves how SUs detect and utilize spectrum holes over PU channels. Our results show that compared to the existing approaches based on retransmission, both PUs and SUs can achieve higher stable throughput, thanks to the spectrum shaping effect of network coding.
Retransmission is the basic method to improve network reliability. Since the broadcasting character and unreliability of wireless links, we could apply the network coding to broadcast retransmission algorithm to impro...
详细信息
Retransmission is the basic method to improve network reliability. Since the broadcasting character and unreliability of wireless links, we could apply the network coding to broadcast retransmission algorithm to improve the efficiency of retransmission. This article does a quantitative analysis for the performance of the wireless broadcast algorithm based on network coding from the delay perspective. Using queue theory to calculate the delay of M/G/1 model, with the input could be saw as Poisson stream and the output as a general process. The simulation results show that the delay calculated through analysis is consistent with the simulation results.
Recent studies have shown that network coding can improve the performance of the distributed storage systems. However, most of these studies are theoretical which mainly focus on the bandwidth efficiency. This paper a...
详细信息
Subcarrier suppression (SS), a recently proposed technique for orthogonal frequency division multiplexing (OFDM) transmissions that suppresses subcarriers with bad channel condition, has been known as an efficient tec...
详细信息
ISBN:
(纸本)9781479984077
Subcarrier suppression (SS), a recently proposed technique for orthogonal frequency division multiplexing (OFDM) transmissions that suppresses subcarriers with bad channel condition, has been known as an efficient technique to improve bit error rate (BER) performance. In this paper, we consider a two way relay network (TWRN) applying SS with decode-and-forward physical layer network coding (DF-PLNC). According to the asymmetry nature of SS, some subcarriers are suppressed on one side. For these subcarriers, one way relay (OWR) is adopted, which reduces the performance of system since the channel condition of the second hop for OWR is bad. To solve this problem, we propose a modified SS scheme combined with subcarrier pairing (SP), called SP based SS (SPSS) where subcarriers that adopt OWR in opposite directions are paired. As a result, BER performance could be improved. Numerical results show that SPSS outperforms traditional SS schemes without pairing in terms of BER performance. Simulations together with analysis verify the potential benefits for combination of SP and SS.
In this paper we consider a network in which one of the nodes wants to send a packet to all the other nodes in the network by broadcasting the packet. At each instant one of the nodes acts as a source and transmits a ...
详细信息
In this paper we consider a network in which one of the nodes wants to send a packet to all the other nodes in the network by broadcasting the packet. At each instant one of the nodes acts as a source and transmits a packet which has to be received by all the other nodes in the network We propose a new distribution for LT codes to perform network coding in a distributed manner. Using LT codes which are fountain codes for network coding at source independent backbone with our particular distribution decreases the number of transmission required to broadcast the packet. Also this distribution allows a better control on the average degree of encoded packets. We carry out simulations to corroborate our idea.
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Commun...
详细信息
暂无评论