IEEE Transactions on Information Theory

Burst decoding of binary block codes on Q-ary output channels.

S. Wainberg, Jack K. Wolf

Published Sep 1, 1972• 17 citations

Abstract

The burst-b distance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input, Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's (1971) weighted erasure decoding. Examples are presented illustrating the techniques.

Related papers

Burst decoding of binary block codes onQ-ary output channels (Corresp.)

S. Wainberg, Jack K. Wolf

The burst-bdistance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input,Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's [2] weighted erasure decoding. Examples are presented illustrating the techniques.

IEEE Transactions on Information TheorySep 1, 197217 citations

Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q greater than q.

S. Wainberg, Jack K. Wolf

Decoding algorithms designed for one output alphabet are shown to be effectively usable for channels with a different output alphabet. The described technique that makes this possible can be used in conjunction with an arbitrary distance measure between input and output vectors. Thus, Hamming distance, Lee distance, or a burst distance can be assumed. Examples are presented for each of these distances.

Information and ComputationApr 1, 19730 citations

On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem

Vyacheslav Davydov

We prove equivalence of using the modulus metric and Euclidean metric in solving the soft decoding problem for a memoryless discrete channel with binary input and Q -ary output. For such a channel, we give an example of a construction of binary codes correcting t binary errors in the Hamming metric. The constructed codes correct errors at the output of a demodulator with Q quantization errors as ( t + 1)( Q − 1) − 1 errors in the modulus metric. The obtained codes are shown to have polynomial decoding complexity.

Problems of Information TransmissionApr 1, 20192 citations

Erasure-Burst and Error-Burst Decoding of Linear Codes

Shumei Song, Shu Lin, Khaled Abdel-Ghaffar +1 more

Iterative algorithms for decoding over erasure-burst channels have attracted much interest lately due to their simplicity. Although the performance of these techniques is typically good, it may not be optimal if the underlying matrix used for decoding is not properly chosen. In this paper, we construct matrices that lead to optimal performance when used with iterative decoding over erasure-burst channels. We also develop a simple decoding technique that makes use of these same matrices to decode any linear code over error-burst channels. For cyclic codes, this algorithm is optimal.

IEEE Information Theory Workshop (ITW)Sep 1, 20076 citations

Estimates of the bit error probabilities for linear block codes and symmetric binary-input memoryless channels

Vladimir B. Balakirsky

A coset representation of the bit error probabilities for binary linear block codes and arbitrary symmetric memoryless channels is derived. Such a representation leads to simple upper bounds on the bit error probabilities for code components expressed via 2n code spectra, where n is the code length, and to a "bounded distance decoding" algorithm. The performance of the algorithm is illustrated for the (23,12) Golay code and a particular channel having non-binary output alphabet where it attains a sub-optimum performance.

IEEE Information Theory Workshop (ITW)Aug 27, 20031 citation

On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels

Ghady Azar

Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors in real-life channels seem to occur in bursts rather than independently, suggesting that these channels exhibit some statistical dependence or memory. Nonetheless, the same algebraic codes are still commonly used in current communication systems that employ interleaving to spread channel error bursts over the set of received codewords to make the channel appear memoryless to the block decoder. This method suffers from immediate shortcomings as it fails to exploit the channel’s memory while adding delay to the system. We study optimal maximum likelihood block decoding of binary codes sent over several binary additive channels with infinite and finite memory. We derive conditions on general binary codes and channels parameters under which maximum likelihood and minimum distance decoding are equivalent. The channels considered in this work are the infinite and finite memory Polya contagion channels [1],

Jan 1, 20131 citation