A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

Thijs Veugen

doi:10.1109/18.556610

A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

Thijs Veugen

Research output: Contribution to journal › Article › Academic › peer-review

3 Citations (Scopus)

15 Downloads (Pure)

Abstract

A class of multiple-repetition strategies is presented for discrete memoryless channels with noiseless feedback. This extends results obtained by Schalkwijk (1971) to nonbinary, asymmetric memoryless channels. An interesting characterization of the attainability of a rate is presented in terms of a generating polynomial, from which follows that for each strategy in our class, there exists a discrete memoryless channel such that capacity can be achieved on this channel.

Original language	English
Article number	556610
Pages (from-to)	2221-2228
Number of pages	8
Journal	IEEE transactions on information theory
Volume	42
Issue number	6
DOIs	https://doi.org/10.1109/18.556610
Publication status	Published - 1 Nov 1996
Externally published	Yes

Keywords

Feedback
Memoryless systems
Delay
Fault tolerance
World Wide Web
Parallel processing
Capacity planning
Error probability
Convolutional codes
Channel capacity

Access to Document

10.1109/18.556610

ArticleFinal published version, 802 KB

Cite this

@article{eb4be03ba8ff4b39814c128a3e614c23,

title = "A simple class of capacity-achieving strategies for discrete memoryless channels with feedback",

abstract = "A class of multiple-repetition strategies is presented for discrete memoryless channels with noiseless feedback. This extends results obtained by Schalkwijk (1971) to nonbinary, asymmetric memoryless channels. An interesting characterization of the attainability of a rate is presented in terms of a generating polynomial, from which follows that for each strategy in our class, there exists a discrete memoryless channel such that capacity can be achieved on this channel.",

keywords = "Feedback, Memoryless systems, Delay, Fault tolerance, World Wide Web, Parallel processing, Capacity planning, Error probability, Convolutional codes, Channel capacity",

author = "Thijs Veugen",

year = "1996",

month = nov,

day = "1",

doi = "10.1109/18.556610",

language = "English",

volume = "42",

pages = "2221--2228",

journal = "IEEE transactions on information theory",

issn = "1557-9654",

publisher = "IEEE",

number = "6",

}

TY - JOUR

T1 - A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

AU - Veugen, Thijs

PY - 1996/11/1

Y1 - 1996/11/1

N2 - A class of multiple-repetition strategies is presented for discrete memoryless channels with noiseless feedback. This extends results obtained by Schalkwijk (1971) to nonbinary, asymmetric memoryless channels. An interesting characterization of the attainability of a rate is presented in terms of a generating polynomial, from which follows that for each strategy in our class, there exists a discrete memoryless channel such that capacity can be achieved on this channel.

AB - A class of multiple-repetition strategies is presented for discrete memoryless channels with noiseless feedback. This extends results obtained by Schalkwijk (1971) to nonbinary, asymmetric memoryless channels. An interesting characterization of the attainability of a rate is presented in terms of a generating polynomial, from which follows that for each strategy in our class, there exists a discrete memoryless channel such that capacity can be achieved on this channel.

KW - Feedback

KW - Memoryless systems

KW - Delay

KW - Fault tolerance

KW - World Wide Web

KW - Parallel processing

KW - Capacity planning

KW - Error probability

KW - Convolutional codes

KW - Channel capacity

U2 - 10.1109/18.556610

DO - 10.1109/18.556610

M3 - Article

SN - 1557-9654

VL - 42

SP - 2221

EP - 2228

JO - IEEE transactions on information theory

JF - IEEE transactions on information theory

IS - 6

M1 - 556610

ER -

A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

Abstract

Keywords

Access to Document

Fingerprint

Cite this