A Capacity Formula for Multi-Input Erasure Channel

Tsutomu KAWABATA

doi:10.1093/ietfec/e90-a.9.1881

A Capacity Formula for Multi-Input Erasure Channel

Tsutomu KAWABATA

Full Text Views

0

Cite this

Summary :

A multi-input erasure channel is defined as the J(J+1) discrete memoryless channel, for which we study a capacity formula, through the method by Muroga. We first give a simpler capacity formula for the multi-input erasure channel with no cross probability. Next we give an upper bound to the capacity for the general case. Finally we remark that the upper bound is actually the capacity when the cross probability is small.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.9 pp.1881-1884

Publication Date: 2007/09/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e90-a.9.1881

Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)

Category

Cite this

Copy

Tsutomu KAWABATA, "A Capacity Formula for Multi-Input Erasure Channel" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 9, pp. 1881-1884, September 2007, doi: 10.1093/ietfec/e90-a.9.1881.
Abstract: A multi-input erasure channel is defined as the J(J+1) discrete memoryless channel, for which we study a capacity formula, through the method by Muroga. We first give a simpler capacity formula for the multi-input erasure channel with no cross probability. Next we give an upper bound to the capacity for the general case. Finally we remark that the upper bound is actually the capacity when the cross probability is small.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.9.1881/_p

Copy

@ARTICLE{e90-a_9_1881,
author={Tsutomu KAWABATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Capacity Formula for Multi-Input Erasure Channel},
year={2007},
volume={E90-A},
number={9},
pages={1881-1884},
abstract={A multi-input erasure channel is defined as the J(J+1) discrete memoryless channel, for which we study a capacity formula, through the method by Muroga. We first give a simpler capacity formula for the multi-input erasure channel with no cross probability. Next we give an upper bound to the capacity for the general case. Finally we remark that the upper bound is actually the capacity when the cross probability is small.},
keywords={},
doi={10.1093/ietfec/e90-a.9.1881},
ISSN={1745-1337},
month={September},}

Copy

TY - JOUR
TI - A Capacity Formula for Multi-Input Erasure Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1881
EP - 1884
AU - Tsutomu KAWABATA
PY - 2007
DO - 10.1093/ietfec/e90-a.9.1881
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2007
AB - A multi-input erasure channel is defined as the J(J+1) discrete memoryless channel, for which we study a capacity formula, through the method by Muroga. We first give a simpler capacity formula for the multi-input erasure channel with no cross probability. Next we give an upper bound to the capacity for the general case. Finally we remark that the upper bound is actually the capacity when the cross probability is small.
ER -