ASYMPTOTIC ERROR CODING BOUNDS FOR THE BINARY SYMMETRIC CHANNEL WITH FEEDBACK.

Abstract

Various asymptotic upper and lower bounds are calculated for linear (parity check) codes used with the Binary Symmetric Channel (BSC) with feedback. The feedback channel is take to be noiseless and capable of instantaneous trans mission. Two types of feedback are considered: (1) Decision Feedback, in which case one bit is fed back for each word transmitted in the for ward channel, and (2) Information Feedback, in which case each received binary digit is fed back to the transmitter. The bounds calculated herein indicate that the best variable-length code has a higher probability of erroneous decoding than the best fixed-length code in which the feedback is used to vary the number of information symbols per word. They also indicate that the best code used without feedback has a higher probability of erroneous decoding than the best code used with decision feedback, which in turn has a higher probability of erroneous decoding than the best code used with information feedback. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 28, 1963
Accession Number
AD0412793

Entities

People

  • Edward J. Weldon

Organizations

  • University of Florida

Tags

DTIC Thesaurus Topics

  • Bits
  • Coding
  • Decoding
  • Feedback
  • Message Decoding
  • Notation
  • Probability
  • Symbols
  • Transmitters

Readers

  • Calculus or Mathematical Analysis
  • Computer Programming and Software Development.