A comparison of four coding methods
Date
1968
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The asymptotic behavior of four coding schemes is evaluated by the norm logQ/log(1/Pe), where Q is an approximation of the amount of computation for decoding, and Pe is the probability of error. The four schemes considered are: (1) Maximum-likelihood decoding, (2) Convolutional codes with syndrome decoding, (3) BCH codes, (4) Finite state and convolutional codes with sequential decoding. Documentation and a listing are included for a computer program which maximizes the frequently used function Eo(8,r) with respect to r for general discrete memoryless channels.
Description
Advisor
Degree
Master of Science
Type
Thesis
Keywords
Citation
McCartney, Sheila JoAn. "A comparison of four coding methods." (1968) Master’s Thesis, Rice University. https://hdl.handle.net/1911/89737.
Has part(s)
Forms part of
Published Version
Rights
Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.