Related papers: Modelling Decoding Errors in HARQ
For decades, cellular networks have greatly evolved to support high data rates over reliable communication. Hybrid automatic-repeat-request (ARQ) is one of the techniques to make such improvement possible. However, this advancement is…
We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a…
This paper introduces techniques to construct binary polar source/channel codes based on the bit error probability of successive-cancellation decoding. The polarization lemma is reconstructed based on the bit error probability and then…
This paper introduces hybrid automatic repeat request with incremental redundancy (HARQ-IR) to boost the reliability of short packet communications. The finite blocklength information theory and correlated decoding events tremendously…
This paper extends some approximation methods that are used to identify closed form Bit Error Rate (BER) expressions which are frequently utilized in investigation and comparison of performance for wireless communication systems in the…
This paper analyzes the performance of cooperative hybrid automatic repeat request with incremental redundancy (HARQ-IR) and proposes a new approach of outage probability approximation for performance analysis. A general time-correlated…
Understanding the probability of error is paramount in the design and analysis of digital communication systems, particularly in Rayleigh fading channels where signal impairments are prevalent. This article presents a unified approach for…
This paper presents a method to calculate the exact average block error probability of some random code ensembles under maximum-likelihood decoding. The proposed method is applicable to various channels and ensembles. The focus is on both…
We present a novel approach for learning an HMM whose outputs are distributed according to a parametric family. This is done by {\em decoupling} the learning task into two steps: first estimating the output parameters, and then estimating…
In this work we present some results that allow to improve the decoding radius in solving polynomial linear systems with errors in the scenario where errors are additive and randomly distributed over a finite field. The decoding radius…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
In this paper, a simulation-based method for the analysis and design of abstracted models for a stochastic hybrid system is proposed. The accuracy of a model is evaluated in terms of its capability to reproduce the system output for all the…
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent…
A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding…
We propose a linear-optical implementation of a hyperentanglement-assisted quantum error-correcting code. The code is hyperentanglement-assisted because the shared entanglement resource is a photonic state hyperentangled in polarization and…
We propose a novel method to calculate logical error rates in surface codes, assuming independent and identically distributed physical errors. We show how to use our method to analyze hypothetical quantum computers with various…
The exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decodeand- forward (DF) relay networks in non-identical Rayleigh fading channels are derived. We also provide the approximate…
For a number of quantum channels of interest, phase-flip errors occur far more frequently than bit-flip errors. When transmitting across these asymmetric channels, the decoding error rate can be reduced by tailoring the code used to the…
Practical random network coding based schemes for multicast include a header in each packet that records the transformation between the sources and the terminal. The header introduces an overhead that can be significant in certain…
In the area of basic and network coded cooperative communication, the expected end-to-end bit error rate (BER) values are frequently required to compare the proposed coding, relaying, and decoding techniques. Instead of obtaining these…