The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Network coding designs over GF(q) spans an extensive range of research directions covering a wide range of applications. Galois field used for network coding should be a function of the total number of nodes in the networks. Thus, the larger the number of sources and relays the larger the Galois field, while keeping the same diversity order in relay-aided transmission. Furthermore, the modulation...
Since data are originated and processed by multiple agents in wireless sensor networks, data provenance plays an important role for assuring data trustworthiness. However, the size of the provenance tends to increase at a higher rate as it is transmitted from the source to the base station and is processed by many intermediate nodes. Due to bandwidth and energy limitations of wireless sensor networks,...
The real-time streams play an increasingly important role in both traditional and emerging networks. Whereas, transmitting such streams requires vast channel resources, posing a huge challenge to the networks. Motivated by this problem, this paper considers a real-time stream system, where real-time messages with different importance should be transmitted through a burst erasure channel, and be decoded...
In this paper, we consider a binary energy harvesting transmitter that wishes to control the amount of side information the receiver can obtain about its energy harvests. Specifically, we study state amplification and state masking, which define the maximum and minimum amount of state information conveyed to the receiver for a given message rate, respectively. For an independent and identically distributed...
This paper reviews the relationship among several notions of capacity regions of a general discrete memoryless network under different code classes and performance criteria, such as average vs. maximal or block vs. bit error probabilities and deterministic vs. randomized codes. Applications of these meta-theorems include several structural results on capacity regions and a simple proof of the network...
Polar codes can be used to achieve secrecy capacity of degraded wiretap channels. In this paper, we propose a feedback-based secrecy coding scheme using polar code over non-degraded wiretap channels. With the feedback architecture, the proposed secrecy coding scheme can significantly obtain a positive secrecy rate. Moreover, polar codes have low complexity of encoding and decoding, which is good for...
In this paper we present a code design technique which produces codes for syndrome coding which have better secrecy than the best error correcting codes. Code examples are given for the case where the number of parity bits of the code is equal to 15. The code design technique presented is based on extensions of the parity check matrix of a set of good equivocation codes of shorter length. It is also...
A scaling technique is proposed to maintain the decoding failure probability of Vector Symbol Decoding (VSD) with the increase in data rate. Specifically, the symbol size must be increased in the same ratio as the data rate. VSD is attractive since it allows for a very flexible scaling. This paper also presents a way to compute the optimal maximum number of syndromes to minimize the complexity of...
This paper consider the problem of a two user discrete memoryless cooperative multiple-access channel (DM-CMAC) where non-causal side information is available at the encoders. According to this channel model, two users have access to a common message which is transmitted to a destination, while both of them have an individual information intended for the destination respectively. On condition that...
In this paper, a new method is proposed for constructing frame length specific LDPC codes which consume low power in encoding and decoding processes. A seed matrix is used and extended to form the parity check matrix having frame lengths divisible by 32 and 64. This method can be used to construct the LDPC codes with frame lengths divisible by even higher power of 2. The memory requirements for encoding...
In this paper, state dependent relay channel (SD- RC) with causal channel state information (CSI) is considered. Two different cases are investigated in which causal CSI is available: 1) only at the relay node, 2) at all the nodes. The second situation is specialized to cases where causal CSI is known: at both source and relay; at both destination and relay. We established the lower bounds for these...
Coverage enhancement is important to support and broaden the application of the machine type communication( MTC) in long term evolution (LTE). Coverage enhancement for physical downlink control channel(PDCCH) is one key issue. A new compact PDCCH for MTC was widely proposed to provide coverage enhancement gain. However, due to the inclusion of cyclic redundancy check(CRC) sequence, the coverage enhancement...
A low-density parity-check (LDPC) code of column weight of 2 is known as an LDPC cycle code. In this paper, we study the encoding algorithm about a type of non-binary quasi-cyclic LDPC cycle codes. The position of parity check symbols is located firstly through parity check equations. Then, we show that these parity check symbols can be calculated linearly through the corresponding Tanner graph. It...
In this paper, the performance of Luby Transform (LT) codes with modified degree distribution (MDD) is investigated for packet erasure channels (PEC). In LT codes, the number of degree-1 encoded symbols at the receiver plays a vital role in the successful recovery of all information symbols. Hence, this work aims to determine the optimal number of received encoded symbols needed to be degree-1 at...
A fundamental problem in wireless networks is to develop an effective communication protocols that achieve high throughput by using user's diversity. In broadcast system. Thus, users with better channel performance has to wait others to receive all information, and results in a waste of the wireless resources. To cope with this problem, we propose a novel fountain code called Unequal Fountain code...
This paper proposes an extrinsic information transfer (EXIT)-chart based optimization technique of LDPC codes for the transmission of quantized Gauss-Markov (GM) source samples over additive white Gaussian (AWGN) noise channels. A joint source and channel (JSC) decoding technique of the proposed code is also devised. In the proposed scheme, no interleaving is performed between the source and the JSC...
A K-user nonbinary parallel concatenated code (PCC) is proposed for a Gaussian MAC with symbol synchronization, equal-power, and equal-rate users. In a K-user q-ary PCC over finite field GF(q), each user employs a parallel concatenated code, with a rate-(1/r) q-ary repetition component code and M rate-1 q-ary accumulation component codes. Employing q-ary repetition code is to overcome the multi-user...
We analyse the two most promising modulation formats for High Data Rate (HDR) downlink from satellite Earth Observation platform to ground stations. For these systems, we investigate their main performance and complexity in a variety of possible implementations.
The index coding problem is a simple distributed source coding problem in which a sender broadcasts multiple messages to their respective receivers with side information about other messages. This problem arises in many applications such as content broadcasting, distributed caching, and wireless interference management. At the same time, it is a canonical instance of the multiple-unicast network coding...
We study a relay channel with confidential messages (RCC), which involves a sender, a receiver and a relay. In the RCC, a common information must be transmitted to both a receiver and a relay and also a private information to the intended receiver, while keeping the relay as ignorant of it as possible. The level of ignorance of the relay rather than the private message is measured by the equivocation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.