DC-free coset codes
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 bou...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1988
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/96 https://ink.library.smu.edu.sg/context/sis_research/article/1095/viewcontent/DC_free_coset_codes.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| id |
sg-smu-ink.sis_research-1095 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.sis_research-10952019-04-02T03:11:18Z DC-free coset codes DENG, Robert H. Herro, M. A. 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 1988-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/96 info:doi/10.1109/18.9775 https://ink.library.smu.edu.sg/context/sis_research/article/1095/viewcontent/DC_free_coset_codes.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Information Security |
| institution |
Singapore Management University |
| building |
SMU Libraries |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
SMU Libraries |
| collection |
InK@SMU |
| language |
English |
| topic |
Information Security |
| spellingShingle |
Information Security DENG, Robert H. Herro, M. A. DC-free coset codes |
| description |
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 |
| format |
text |
| author |
DENG, Robert H. Herro, M. A. |
| author_facet |
DENG, Robert H. Herro, M. A. |
| author_sort |
DENG, Robert H. |
| title |
DC-free coset codes |
| title_short |
DC-free coset codes |
| title_full |
DC-free coset codes |
| title_fullStr |
DC-free coset codes |
| title_full_unstemmed |
DC-free coset codes |
| title_sort |
dc-free coset codes |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
1988 |
| url |
https://ink.library.smu.edu.sg/sis_research/96 https://ink.library.smu.edu.sg/context/sis_research/article/1095/viewcontent/DC_free_coset_codes.pdf |
| _version_ |
1770568887903977472 |