IEEE Transactions on Information Theory

Burst-error and random-error correction over q-ary input, p-ary output channels (Ph.D. Thesis abstr.)

S. Wainberg

Published Mar 1, 1972• 5 citations

Publisher

DOI: 10.1109/tit.1972.1054778

Related papers

Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q > q

S. Wainberg, Jack Keil Wolf

Information and ControlApr 1, 19739 citations

Efficient decoding algorithms for linear codes on soft-quantized channels (Ph.D. Thesis abstr.)

C. Yu

IEEE Transactions on Information TheoryNov 1, 19780 citations

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

S. Wainberg, Jack K. Wolf

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.

IEEE Transactions on Information TheorySep 1, 197217 citations

Error detecting codes for the q-ary symmetric channel

Series on coding theory and cryptologyApr 1, 20070 citations

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

Q-ary Error-Correcting Codes with Feedback

Christian Deppe

Feb 2, 20190 citations