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 journalArticleAcademicpeer-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 languageEnglish
Pages (from-to)3-9
Number of pages7
JournalIEEE Transactions on Information Theory
Volume31
Issue number1
DOIs
Publication statusPublished - 1985

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