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.
Almost Instantaneous VF code proposed by Yamamoto and Yokoo in 2001, which is one of the variable-length to-fixed-length codes, uses a set of parse trees and achieves a good compression ratio. However, it needs much time and space for both encoding and decoding than a conventional VF code. Yoshida and Kida showed in 2010 that the set of trees can be multiplexed into a compact single tree and the original...
The Chinese remainder codes has been studied when only errors occur. We propose an error-erasure-decoder for the Chinese remainder codes and analyze the decoding radius.
In FD-AWGN relay channel, the source sends the superposition of many capacity-achieving codewords. The relay decodes them using successive interference cancellation (SIC) and sends the superposition of the same codewords multiplied by random dither sequences and with a new power distribution among the codewords. The destination node decodes all code-words by removing the dithering and then applying...
In this paper, we analyze the coding delay and the average coding delay of Chunked network Codes (CC) over line networks with Bernoulli losses and deterministic regular or Poisson transmissions. Chunked codes are an attractive alternative to random linear network codes due to their lower complexity. Our results, which include upper bounds on the delay and the average delay, are the first of their...
In this paper, the two-user interference relay channel (IRC) is studied. Transmission schemes for this network are compared. Namely, compress-and-forward (CF) and functional decode-and-forward (FDF) are presented. In CF, the relay establishes cooperation with the users by compressing its observation and forwarding it to the receivers. In FDF, the relay decodes a linear combination of the transmitted...
In this paper, some codes are designed for a binary chip-asynchronous CDMA system which guarantee errorless communication in the absence of noise. These codes also show good performance for noisy channels. In addition, lower and upper bounds for the sum channel capacity are derived for finite and asymptotic cases with the assumption of both noiseless and noisy channels. The results are derived assuming...
We introduce a framework to study fundamental limits of sequential coding of Markov sources under an error propagation constraint. An encoder sequentially compresses a sequence of vector-sources that are spatially i.i.d. but temporally correlated according to a Markov process. The channel erases up to B packets in a single burst, but reveals all other packets to the destination. The destination is...
This paper focuses on the Gaussian two-terminal source coding problem under a covariance matrix distortion constraint, which subsumes the quadratic Gaussian two-terminal source coding problem with individual distortion constraints, whose complete solution is known. Different from existing schemes which are either random or structured, we propose a new hybrid random-structured scheme with a sum-rate...
A challenging problem related to the design of polar codes is “robustness against channel parameter variations”, as stated in Arıkan's original work. In this paper, we show that mismatched polar codes with a decoder implementation based on an approximation of the polarization transformations proposed in [3] are robust for the class of binary symmetric channels. We carry numerical simulations for the...
This paper derives an asymptotic closed form expression for the ratio between minimal codeword length in systematic T-augmentation and expected codeword length in random T-augmentation, confirming existing empirical results by Hamano. We also show that this ratio corresponds, in the limit, to the ratio between the maximal T-complexity and the T-complexity of random strings of a given string length.
In this paper, the diamond relay channel is considered, which consists of one source-destination pair and two relay nodes connected with rate-limited out-of-band conferencing links. In particular, we focus on the half-duplex alternative relaying strategy, in which the two relays operate alternatively over time. With different amounts of delay, two conferencing strategies are proposed, each of which...
Refined bounds on the probability of decoding error for arbitrary multiple-access channels with correlated sources are derived. The contribution of this paper is to give new upper bounds on the probability of decoding error for any given blocklength. These bounds can be used for the analysis over any multiple-access channels with correlated and uncorrelated sources in the finite blocklength regime...
Phase-change memory (PCM) is a promising non- volatile solid-state memory technology. A PCM cell stores data by using its amorphous and crystalline states. The cell changes between these two states using high temperature. However, since the cells are sensitive to high temperature, it is important, when programming cells, to balance the heat both in time and space. In this paper, we study the time-space...
Quasi-cyclic Low-Density Parity-Check (QC-LDPC) codes based on protographs are of great interest to code designers because of their implementation advantages and algebraic properties that make them easy to analyze. However, the protograph structure imposes undesirable fixed upper limits on important code parameters. In this paper, we show that the upper bound on the minimum Hamming distance of protograph-based...
We propose the construction of a non-binary multiple insertion/deletion correcting code based on a binary multiple insertion/deletion correcting code. In essence, it is a generalisation of Tenengol'ts' non-binary single insertion/deletion correcting code. We evaluate the cardinality of the proposed construction based on the asymptotic upper bound on the cardinality of a maximal binary multiple insertion/deletion...
A Write-Once Memory (WOM)-code is a coding scheme that allows information to be written in a memory block multiple times, but in a way that the stored values are not decreased across writes. This work studies non-binary WOM-codes with applications to flash memory. We present two constructions of non-binary WOM-codes that leverage existing high sum-rate WOM-codes defined over smaller alphabets. In...
The dynamic decode-and-forward (DDF) protocol for the multiple access relay channel (MARC) with quasi static fading is evaluated using the Zheng-Tse diversity-multiplexing tradeoff (DMT). We assume that there are two users, one half-duplex relay, and a common destination, each equipped with single antenna. For the Rayleigh fading channel, the DDF protocol is well known and has been analyzed in terms...
In this paper, the decoding failure probability for {\it sparse} random linear network coding in a probabilistic network model is analyzed. The network transfer matrix is modeled by a random matrix consisting of independently and identically distributed elements chosen from a large finite field, and the probability of choosing each nonzero field element tends to zero, as the finite field size tends...
In this paper, we propose a novel MIMO transmission scheme, called trellis coded spatial modulation (TC-SM) in which the trellis (convolutional) encoder and the spatial modulation (SM) mapper are jointly designed similar to the conventional trellis coded modulation (TCM). A soft decision Viterbi decoder, which is fed with the soft information supplied by the optimal SM decoder, is used at the receiver...
A half-duplex wireless network with 6 lateral nodes, 3 transmitters and 3 receivers, and a central relay is considered. The transmitters wish to send information to their corresponding receivers via a two phase communication protocol. The receivers decode their desired messages by using side information and the signals received from the relay. We derive an outer bound on the capacity region of any...
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.