A family of good uniquely decodable code pairs for the two-access binary adder channel

P.A.B.M. Coebergh van den Braak; H.C.A. Tilborg, van

doi:10.1109/TIT.1985.1057004

A family of good uniquely decodable code pairs for the two-access binary adder channel

P.A.B.M. Coebergh van den Braak, H.C.A. Tilborg, van

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

25 Citations (Scopus)

Abstract

An explicit construction is presented of uniquely decodable code pairs for the two-access binary erasure channel. Through a computer search we found many code pairs coming from this construction with a rate pair above the nonconstructive lower bound known in the literature. Also presented is a simple uniquely decodable code pair, with a high rate pair, found by a different method.

Original language	English
Pages (from-to)	3-9
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	31
Issue number	1
DOIs	https://doi.org/10.1109/TIT.1985.1057004
Publication status	Published - 1985

Access to Document

10.1109/TIT.1985.1057004

Fingerprint Dive into the research topics of 'A family of good uniquely decodable code pairs for the two-access binary adder channel'. Together they form a unique fingerprint.

Cite this

@article{f8dfe64a0e8f4beabaf21da2dfb3c07d,

title = "A family of good uniquely decodable code pairs for the two-access binary adder channel",

abstract = "An explicit construction is presented of uniquely decodable code pairs for the two-access binary erasure channel. Through a computer search we found many code pairs coming from this construction with a rate pair above the nonconstructive lower bound known in the literature. Also presented is a simple uniquely decodable code pair, with a high rate pair, found by a different method.",

author = "{Coebergh van den Braak}, P.A.B.M. and {Tilborg, van}, H.C.A.",

year = "1985",

doi = "10.1109/TIT.1985.1057004",

language = "English",

volume = "31",

pages = "3--9",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - A family of good uniquely decodable code pairs for the two-access binary adder channel

AU - Coebergh van den Braak, P.A.B.M.

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

PY - 1985

Y1 - 1985

N2 - An explicit construction is presented of uniquely decodable code pairs for the two-access binary erasure channel. Through a computer search we found many code pairs coming from this construction with a rate pair above the nonconstructive lower bound known in the literature. Also presented is a simple uniquely decodable code pair, with a high rate pair, found by a different method.

AB - An explicit construction is presented of uniquely decodable code pairs for the two-access binary erasure channel. Through a computer search we found many code pairs coming from this construction with a rate pair above the nonconstructive lower bound known in the literature. Also presented is a simple uniquely decodable code pair, with a high rate pair, found by a different method.

U2 - 10.1109/TIT.1985.1057004

DO - 10.1109/TIT.1985.1057004

M3 - Article

VL - 31

SP - 3

EP - 9

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -