A linear programming bound for codes in a 2-access binary erasure channel

H.C.A. Tilborg, van

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

Two counting arguments are used to derive a system of linear inequalities which give rise to an upperbound on the size of a code for a 2-access binary erasure channel.

For uniquely decodable codes this bound reduces to a purely combinatorial proof of a result by Liao. Examples of this bound are given for some codes with minimum distance 4.
Original languageEnglish
Title of host publicationMulti-user communication systems
EditorsG. Longo
Place of PublicationVienna
PublisherSpringer
Chapter8
Pages243-258
Number of pages16
ISBN (Electronic)978-3-7091-2900-5
ISBN (Print)978-3-211-81612-7
DOIs
Publication statusPublished - 1981

Publication series

NameCISM Courses and Lectures
Volume265
ISSN (Print)0254-1971

Fingerprint

Dive into the research topics of 'A linear programming bound for codes in a 2-access binary erasure channel'. Together they form a unique fingerprint.

Cite this