Related papers: A Closed Form Expression for the Exact Bit Error P…
We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…
We find the exact typical error exponent of constant composition generalized random Gilbert-Varshamov (RGV) codes over DMCs channels with generalized likelihood decoding. We show that the typical error exponent of the RGV ensemble is equal…
Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder…
This paper establishes the exact strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence speed of the total variation to one when a code of rate below…
This paper proposes a novel deep learning-based error correction coding scheme for AWGN channels under the constraint of one-bit quantization in the receivers. Specifically, it is first shown that the optimum error correction code that…
Doubly-selective channels, such as those that occur when the transmitter and the receiver move relative to each other at high speeds, are a key scenario for fifth generation (5G) cellular systems, which are mostly based in the use of the…
Sigma-Delta modulation is a popular method for analog-to-digital conversion of bandlimited signals that employs coarse quantization coupled with oversampling. The standard mathematical model for the error analysis of the method measures the…
Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated, and new algorithms…
In this paper, a refinement of the weight distribution in an MDS code is computed. Concretely, the number of codewords with a fixed amount of nonzero bits in both information and redundancy parts is obtained. This refinement improves the…
We consider a channel-independent decoder which is for i.i.d. random codes what the maximum mutual-information decoder is for constant composition codes. We show that this decoder results in exactly the same i.i.d. random coding error…
Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or \iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the…
Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the…
In this work we propose a novel decoding algorithm for tailbiting convolutional codes and evaluate its performance over different channels. The proposed method consists on a fixed two-step Viterbi decoding of the received data. In the first…
A List Viterbi detector produces a rank ordered list of the N globally best candidates in a trellis search. A List Viterbi detector structure is proposed that incorporates the noise prediction with periodic state-metric updates based on…
A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in…
For a system of N spins 1/2 there are quantum states that can encode a direction in an intrinsic way. Information on this direction can later be decoded by means of a quantum measurement. We present here the optimal encoding and decoding…
Two decoder structures for coded modulation over the Gaussian and flat fading channels are studied: the maximum likelihood symbol-wise decoder, and the (suboptimal) bit-wise decoder based on the bit-interleaved coded modulation paradigm. We…
Determining the exact decoding error probability of linear block codes is an interesting problem. For binary BCH codes, McEliece derived methods to estimate the error probability of a simple bounded distance decoding (BDD) for BCH codes.…
The security level of the achievability scheme for Wyner's wiretap channel model is examined from the perspective of the probability of correct decoding, $P_c$, at the wiretap channel decoder. In particular, for finite-alphabet memoryless…
In ultra-wideband (UWB) communication systems with impulse radio (IR) modulation, the bandwidth is usually 1GHz or more. To process the received signal digitally, high sampling rate analog-digital-converters (ADC) are required. Due to the…