The relative generalized Hamming weight (RGHW) M r (C,C 1 ) of an [n, k] (linear) code C and an [n, k 1 ] subcode C 1 , a generalization of generalized Hamming weight (GHW), has been applied to wiretap channel, networ...
详细信息
The relative generalized Hamming weight (RGHW) M r (C,C 1 ) of an [n, k] (linear) code C and an [n, k 1 ] subcode C 1 , a generalization of generalized Hamming weight (GHW), has been applied to wiretap channel, network coding, linear ramp secret sharing, and trellis complexity, etc. Asymptotic analysis of RGHW is useful for investigating the optimal performance of these applications when code length is sufficiently large. For linear ramp secret sharing schemes, the asymptotic metric we previously introduced is inconvenient for characterizing its performance mainly because the rate of information leakage is not *** this paper, we improve the previous work by introducing two new asymptotic metrics, respectively, for the cases that r is fixed and r is proportionally increasing with n. For fixed r, we show the asymptotic Singleton, Plotkin and Gilbert-Varshamov bounds on the first metric. For increasing r, we determine the value of the second metric.
Packet loss recovery in wireless broadcast is challenging, particularly for real-time applications which have strict and short delivery deadline. To recover the maximum number of lost packets within a short time, exis...
详细信息
We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version o...
详细信息
ISBN:
(纸本)9781538612248
We consider network coding for a noiseless broadcast channel where each receiver demands a subset of messages available at the transmitter and is equipped with noisy side information in the form an erroneous version of the message symbols it demands. We view the message symbols as elements from a finite field and assume that the number of symbol errors in the noisy side information is upper bounded by a known constant. This communication problem, which we refer to as broadcasting with noisy side information (BNSI), has applications in the re-transmission phase of downlink networks. We derive a necessary and sufficient condition for a linear coding scheme to satisfy the demands of all the receivers in a given BNSI network, and show that syndrome decoding can be used at the receivers to decode the demanded messages from the received codeword and the available noisy side information. We represent BNSI problems as bipartite graphs, and using this representation, classify the family of problems where linear coding provides bandwidth savings compared to uncoded transmission. We also provide a simple algorithm to determine if a given BNSI network belongs to this family of problems, i.e., to identify if linear coding provides an advantage over uncoded transmission for the given BNSI problem.
In vehicular ad hoc networks, vehicular nodes take the responsibility of data collection and exchange for smart transportation services. When an emergency occurs, such as traffic accident, how to propagate the alert m...
详细信息
ISBN:
(纸本)9781538663585
In vehicular ad hoc networks, vehicular nodes take the responsibility of data collection and exchange for smart transportation services. When an emergency occurs, such as traffic accident, how to propagate the alert message to relevant vehicles efficiently and quickly, is still an open problem. In this paper, a neighbor-decoding-based data propagation scheme is proposed, called NED. It utilizes network coding to improve the quality of data transmissions. Considering the options among raw blocks and encoded blocks, the sender selects the one to send, which has the highest decoding capability of neighbors. This selection guarantees a relatively large number of decoded blocks at neighbors after they receive this block. Experiments using real trajectory data show that NED has a high block decoding rate and a high packet coverage rate while keeping similar dissemination delay.
In this paper, we investigate the benefit of Joint network Channel coding (JNCC) for a new class of Multiple Access Relay Channel (MARC), defined as follows: (1) Independent sources communicate with a single destinati...
详细信息
A joint source-channel coding (JSCC) scheme based on hybrid digital/analog coding is proposed for the transmission of correlated sources over discrete-memoryless two-way channels (DM-TWCs). The scheme utilizes the cor...
详细信息
Block scheduling is difficult to implement in P2P network since there is no central coordinator. This problem can be solved by employing network coding technique which allows intermediate nodes to perform the coding o...
详细信息
With the rapid growth of Internet of Things (IoT), the idea of integrating a variety of IoTs has been proposed to support a variety of novel applications. However, IoT devices are often deployed in an open environment...
详细信息
ISBN:
(纸本)9781538647905
With the rapid growth of Internet of Things (IoT), the idea of integrating a variety of IoTs has been proposed to support a variety of novel applications. However, IoT devices are often deployed in an open environment in which IoTs are inclined to be malfunctioned. Although data reliability can be achieved by data recovery with conventional replication, the communication between IoTs is susceptible to eavesdropping. Since most of the current work focuses on designing the architectures for IoTs under the specific scenarios, the eavesdropping prevention for heterogeneous IoT systems remains unexplored. Therefore, in this paper, we consider using the network-coding-based distributed storage systems for security and show that repair bandwidth can be reduced by increasing storage per node. Moreover, we theoretically derive the relation between repair bandwidth and storage in heterogeneous IoT systems. Finally, we show the relation between storage cost and reliability with regard to different amounts of IoT devices.
The Langberg-Medard k-Unicast Conjecture states that for any strongly reachable k-pair network, there exists a multi-flow with rate (1, 1, ..., 1). In this paper, for k = 3, 4, we construct multi-flows with rate (11/1...
详细信息
ISBN:
(纸本)9781538647813
The Langberg-Medard k-Unicast Conjecture states that for any strongly reachable k-pair network, there exists a multi-flow with rate (1, 1, ..., 1). In this paper, for k = 3, 4, we construct multi-flows with rate (11/12, 11/12, ..., 11/12), which improves the previous result (8/9, 8/9, ..., 8/9), and we further prove that our constructions are optimal within the proposed framework.
In this paper, we propose an opportunistic cooperative transmission (OCT) scheme combined with bi-directional relaying and physical layer network coding (PNC) in wireless sensor networks (WSNs).This scheme can be swit...
详细信息
暂无评论