Trellis codes for periodic erasures

Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channels

“…ASD is shown to consistently outperform conventional erasure decoding, which suggests the potential application of ASD to practical systems, such as DSL systems as described in [7].…”

A Study on Universal Codes With Finite Block Lengths

“…In [1], excess mutual information (EMI) was proposed as the figure of merit for the purpose of universal code design. It is defined as EMI (5) where is the rate of the code and is the SNR at which the code achieves a certain target probability of error, is the mutual information of the channel at that SNR given the input distribution.…”

“…The ratetrellis code (in octal) proposed in [1] as a universal code for periodic erasure channels was simulated. This code was designed by minimizing the sum of the residual Euclidean distances and the sum of the SNRs over all the possible erasure patterns.…”

“…A compound channel is a family of channels indexed by denoted by (1) where and are the input and output alphabet, respectively. is the channel index set which can be finite, countably infinite, or uncountably infinite.…”

“…The performance of such channel-specific codes can deteriorate significantly when these codes are faced with unexpected channels. For example, an optimal additive white Gaussian noise (AWGN) code might not perform well under periodic erasure channels [1] or partial band jamming channels [2]. With space-time codes, the comparison in [3,Fig.…”