By Topic

On the undetected error probability of linear block codes on channels with memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Kuznetsov ; Inst. for Problems of Inf. Transmission, Moscow, Russia ; F. Swarts ; H. C. Ferreira

We give an upper band on the undetected error probability of binary (n,k)-codes used on channels with memory described by Markov distributions. This bound is a generalization of the bound presented by Kasami (1983) for the binary symmetric channel (BSC). An extended bound is given for the Gilbert-Elliott channel (1960, 1963) and Markov channels with deterministic errors. We also develop a recursive technique for the exact calculation of the undetected error probability of an arbitrary linear block code used on a Markov type channel. This technique is based on the trellis representation of block codes described by Wolf (1978). Results of the computations are presented

Published in:

Communications and Signal Processing, 1993., Proceedings of the 1993 IEEE South African Symposium on

Date of Conference:

6 Aug 1993