Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel

K.A. Post

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

Abstract

An explicit method is given to evaluate Viterbi's union bounds on both the first event error probability and the bit error probability of binary convolutional codes on a binary symmetric channel. These bounds are evaluated for the rate1/2code with generators1 + D + D^{2}and1 + D^{2}. Comparison is made with the bounds and experimental results of van de Meeberg.
Original languageEnglish
Pages (from-to)403-404
Number of pages2
JournalIEEE Transactions on Information Theory
Volume23
Issue number3
DOIs
Publication statusPublished - 1977

Fingerprint Dive into the research topics of 'Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel'. Together they form a unique fingerprint.

  • Cite this