NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Bounds of the bit error probability of a linear cyclic code over GF(2 exp l) and its extended codeAn upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2 exp l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either HD or soft-decision (SD) ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of SD and HD ML over bounded-distance decoding is established.
Document ID
19890030585
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Cheng, Unjeng
(California Institute of Technology Jet Propulsion Laboratory, Pasadena, United States)
Huth, Gaylord K.
(Axiomatix Los Angeles, CA, United States)
Date Acquired
August 14, 2013
Publication Date
July 1, 1988
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: 34
ISSN: 0018-9448
Subject Category
Cybernetics
Accession Number
89A17956
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available