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

K.A. Post

doi:10.1109/TIT.1977.1055704

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

K.A. Post

Department of Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	403-404
Number of pages	2
Journal	IEEE Transactions on Information Theory
Volume	23
Issue number	3
DOIs	https://doi.org/10.1109/TIT.1977.1055704
Publication status	Published - 1977

Access to Document

10.1109/TIT.1977.1055704

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

Post, K. A. (1977). Explicit evaluation of Viterbi's union bounds on convolutional code performance for the binary symmetric channel. IEEE Transactions on Information Theory, 23(3), 403-404. https://doi.org/10.1109/TIT.1977.1055704

@article{ef98808764ce4f5cb7f0721219b7cc53,

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

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.",

author = "K.A. Post",

year = "1977",

doi = "10.1109/TIT.1977.1055704",

language = "English",

volume = "23",

pages = "403--404",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "3",

}

TY - JOUR

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

AU - Post, K.A.

PY - 1977

Y1 - 1977

N2 - 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.

AB - 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.

U2 - 10.1109/TIT.1977.1055704

DO - 10.1109/TIT.1977.1055704

M3 - Article

VL - 23

SP - 403

EP - 404

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

ER -