Capacity and decoding rules for classes of arbitrarily varying channels

I. Csiszár, Prakash Narayan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Summary form only given, as follows. The authors consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error criterion, and typically subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former, the capacity is explicitly determined and shown to be attainable by minimum-distance decoding. Next, for a large class of additive AVCs. in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, the authors prove that capacity can be attained by a universal decoding rule. Finally, the effect of random state selection on capacity is studied, enabling them to comment on the merits and limitations of a previous mutual information game approach.

Original languageEnglish
Title of host publicationIEEE 1988 Int Symp on Inf Theory Abstr of Pap
PublisherPubl by IEEE
Pages102
Number of pages1
Volume25 n 13
Publication statusPublished - 1988

Fingerprint

Decoding
Channel capacity
Adders

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Csiszár, I., & Narayan, P. (1988). Capacity and decoding rules for classes of arbitrarily varying channels. In IEEE 1988 Int Symp on Inf Theory Abstr of Pap (Vol. 25 n 13, pp. 102). Publ by IEEE.

Capacity and decoding rules for classes of arbitrarily varying channels. / Csiszár, I.; Narayan, Prakash.

IEEE 1988 Int Symp on Inf Theory Abstr of Pap. Vol. 25 n 13 Publ by IEEE, 1988. p. 102.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Csiszár, I & Narayan, P 1988, Capacity and decoding rules for classes of arbitrarily varying channels. in IEEE 1988 Int Symp on Inf Theory Abstr of Pap. vol. 25 n 13, Publ by IEEE, pp. 102.
Csiszár I, Narayan P. Capacity and decoding rules for classes of arbitrarily varying channels. In IEEE 1988 Int Symp on Inf Theory Abstr of Pap. Vol. 25 n 13. Publ by IEEE. 1988. p. 102
Csiszár, I. ; Narayan, Prakash. / Capacity and decoding rules for classes of arbitrarily varying channels. IEEE 1988 Int Symp on Inf Theory Abstr of Pap. Vol. 25 n 13 Publ by IEEE, 1988. pp. 102
@inproceedings{7375e78c98a54b07b45bde34203e1144,
title = "Capacity and decoding rules for classes of arbitrarily varying channels",
abstract = "Summary form only given, as follows. The authors consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error criterion, and typically subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former, the capacity is explicitly determined and shown to be attainable by minimum-distance decoding. Next, for a large class of additive AVCs. in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, the authors prove that capacity can be attained by a universal decoding rule. Finally, the effect of random state selection on capacity is studied, enabling them to comment on the merits and limitations of a previous mutual information game approach.",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "1988",
language = "English",
volume = "25 n 13",
pages = "102",
booktitle = "IEEE 1988 Int Symp on Inf Theory Abstr of Pap",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Capacity and decoding rules for classes of arbitrarily varying channels

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 1988

Y1 - 1988

N2 - Summary form only given, as follows. The authors consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error criterion, and typically subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former, the capacity is explicitly determined and shown to be attainable by minimum-distance decoding. Next, for a large class of additive AVCs. in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, the authors prove that capacity can be attained by a universal decoding rule. Finally, the effect of random state selection on capacity is studied, enabling them to comment on the merits and limitations of a previous mutual information game approach.

AB - Summary form only given, as follows. The authors consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error criterion, and typically subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channels and group adder channels are studied in detail. For the former, the capacity is explicitly determined and shown to be attainable by minimum-distance decoding. Next, for a large class of additive AVCs. in addition to providing an intuitively suggestive simplification of the general AVC capacity formula, the authors prove that capacity can be attained by a universal decoding rule. Finally, the effect of random state selection on capacity is studied, enabling them to comment on the merits and limitations of a previous mutual information game approach.

UR - http://www.scopus.com/inward/record.url?scp=0024122105&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024122105&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024122105

VL - 25 n 13

SP - 102

BT - IEEE 1988 Int Symp on Inf Theory Abstr of Pap

PB - Publ by IEEE

ER -