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

Research output: Contribution to journalArticleAcademicpeer-review

26 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)112-116
Number of pages5
JournalIEEE Transactions on Information Theory
Volume24
Issue number1
DOIs
Publication statusPublished - 1978

Fingerprint

Dive into the research topics of 'An upper bound for codes in a two-access binary erasure channel (corresp.)'. Together they form a unique fingerprint.

Cite this