ON THE DETERMINISTIC AND RANDOM CODING CAPACITIES OF DISCRETE ARBITRARILY VARYING CHANNELS WITH CONSTRAINED STATES.

I. Csiszár, Prakash Narayan

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

Abstract

Summary form only given, as follows. The authors consider the deterministic coding capacities of the following discrete arbitrarily varying channel (AVC) models with constraints on the channel states: (i) the binary adder channel, (ii) the arithmetic adder channel, and (iii) the multiplier channel. For cases (i) and (ii), the deterministic coding capacities equal the respective random coding capacities. For the multiplier channel in case (iii), the deterministic coding capacity, under suitable conditions, is shown to lie strictly between zero and the random coding capacity. The issue of random coding capacities of general discrete AVCs with codeword and state constraints is also addressed.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages161
Number of pages1
Publication statusPublished - 1986

Fingerprint

Adders

ASJC Scopus subject areas

  • Engineering(all)

Cite this

ON THE DETERMINISTIC AND RANDOM CODING CAPACITIES OF DISCRETE ARBITRARILY VARYING CHANNELS WITH CONSTRAINED STATES. / Csiszár, I.; Narayan, Prakash.

Unknown Host Publication Title. IEEE, 1986. p. 161.

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

@inproceedings{d40401c9ef304b17bf32c0b347f5fa70,
title = "ON THE DETERMINISTIC AND RANDOM CODING CAPACITIES OF DISCRETE ARBITRARILY VARYING CHANNELS WITH CONSTRAINED STATES.",
abstract = "Summary form only given, as follows. The authors consider the deterministic coding capacities of the following discrete arbitrarily varying channel (AVC) models with constraints on the channel states: (i) the binary adder channel, (ii) the arithmetic adder channel, and (iii) the multiplier channel. For cases (i) and (ii), the deterministic coding capacities equal the respective random coding capacities. For the multiplier channel in case (iii), the deterministic coding capacity, under suitable conditions, is shown to lie strictly between zero and the random coding capacity. The issue of random coding capacities of general discrete AVCs with codeword and state constraints is also addressed.",
author = "I. Csisz{\'a}r and Prakash Narayan",
year = "1986",
language = "English",
pages = "161",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - ON THE DETERMINISTIC AND RANDOM CODING CAPACITIES OF DISCRETE ARBITRARILY VARYING CHANNELS WITH CONSTRAINED STATES.

AU - Csiszár, I.

AU - Narayan, Prakash

PY - 1986

Y1 - 1986

N2 - Summary form only given, as follows. The authors consider the deterministic coding capacities of the following discrete arbitrarily varying channel (AVC) models with constraints on the channel states: (i) the binary adder channel, (ii) the arithmetic adder channel, and (iii) the multiplier channel. For cases (i) and (ii), the deterministic coding capacities equal the respective random coding capacities. For the multiplier channel in case (iii), the deterministic coding capacity, under suitable conditions, is shown to lie strictly between zero and the random coding capacity. The issue of random coding capacities of general discrete AVCs with codeword and state constraints is also addressed.

AB - Summary form only given, as follows. The authors consider the deterministic coding capacities of the following discrete arbitrarily varying channel (AVC) models with constraints on the channel states: (i) the binary adder channel, (ii) the arithmetic adder channel, and (iii) the multiplier channel. For cases (i) and (ii), the deterministic coding capacities equal the respective random coding capacities. For the multiplier channel in case (iii), the deterministic coding capacity, under suitable conditions, is shown to lie strictly between zero and the random coding capacity. The issue of random coding capacities of general discrete AVCs with codeword and state constraints is also addressed.

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

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

M3 - Conference contribution

AN - SCOPUS:0022983385

SP - 161

BT - Unknown Host Publication Title

PB - IEEE

ER -