DC-free coset codes

Author

Robert H. DENG, Singapore Management UniversityFollow
M. A. Herro

Publication Type

Journal Article

Version

publishedVersion

Publication Date

7-1988

Abstract

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2l) 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 hard- or soft-decision 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 soft-decision (SD) ML and HD ML over bounded-distance (BD) decoding is established

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

IEEE Transactions on Information Theory

Volume

34

Issue

4

First Page

786

Last Page

792

ISSN

0018-9448

Identifier

10.1109/18.9775

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Citation

DENG, Robert H. and Herro, M. A.. DC-free coset codes. (1988). IEEE Transactions on Information Theory. 34, (4), 786-792.
Available at: https://ink.library.smu.edu.sg/sis_research/96

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.

Additional URL

https://doi.org/10.1109/18.9775