On error exponents for arbitrarily varying channels

Author

Hughes, Brian L. ; Thomas, Tony G.

Author_Institution

Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA

Volume

42

Issue

1

fYear

1996

fDate

1/1/1996 12:00:00 AM

Firstpage

87

Lastpage

98

Abstract

The minimum probability of error achievable by random codes on the arbitrarily varying channel (AVC) is investigated. New exponential error bounds are found and applied to the AVC with and without input and state constraints. Also considered is a simple subclass of random codes, called randomly modulated codes, in which encoding and decoding operations are separate from code randomization. A universal coding theorem is proved which shows the existence of randomly modulated codes that achieve the same error bounds as “fully” random codes for all AVCs

Keywords

block codes; coding errors; modulation coding; probability; random processes; telecommunication channels; arbitrarily varying channels; code randomization; decoding; encoding; error bounds; error exponents; exponential error bounds; minimum error probability; random block codes; random codes; randomly modulated codes; state constraints; universal coding theorem; Automatic voltage control; Block codes; Communication systems; Decoding; Error probability; Helium; Information theory; Jamming; Laboratories; Modulation coding;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.481780

Filename

481780