An upper bound for codes in a two-access binary erasure channel (corresp.)

H.C.A. Tilborg, van

doi:10.1109/TIT.1978.1055814

An upper bound for codes in a two-access binary erasure channel (corresp.)

H.C.A. Tilborg, van

Discrete Mathematics

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

26 Citaten (Scopus)

Samenvatting

A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.

Originele taal-2	Engels
Pagina's (van-tot)	112-116
Aantal pagina's	5
Tijdschrift	IEEE Transactions on Information Theory
Volume	24
Nummer van het tijdschrift	1
DOI's	https://doi.org/10.1109/TIT.1978.1055814
Status	Gepubliceerd - 1978

Toegang tot document

10.1109/TIT.1978.1055814

Citeer dit

@article{9e7c28eeeb9744c682fa8936aa1737cc,

title = "An upper bound for codes in a two-access binary erasure channel (corresp.)",

abstract = "A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.",

author = "{Tilborg, van}, H.C.A.",

year = "1978",

doi = "10.1109/TIT.1978.1055814",

language = "English",

volume = "24",

pages = "112--116",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - An upper bound for codes in a two-access binary erasure channel (corresp.)

AU - Tilborg, van, H.C.A.

PY - 1978

Y1 - 1978

N2 - A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.

AB - A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.

U2 - 10.1109/TIT.1978.1055814

DO - 10.1109/TIT.1978.1055814

M3 - Article

SN - 0018-9448

VL - 24

SP - 112

EP - 116

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

An upper bound for codes in a two-access binary erasure channel (corresp.)

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit