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

H.C.A. Tilborg, van

doi:10.1007/978-3-7091-2900-5_8

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

H.C.A. Tilborg, van

Discrete Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-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 language	English
Title of host publication	Multi-user communication systems
Editors	G. Longo
Place of Publication	Vienna
Publisher	Springer
Chapter	8
Pages	243-258
Number of pages	16
ISBN (Electronic)	978-3-7091-2900-5
ISBN (Print)	978-3-211-81612-7
DOIs	https://doi.org/10.1007/978-3-7091-2900-5_8
Publication status	Published - 1981

Publication series

Name	CISM Courses and Lectures
Volume	265
ISSN (Print)	0254-1971

Access to Document

10.1007/978-3-7091-2900-5_8

Cite this

@inbook{3ed065dbfe254bed803ede92b22bf74d,

title = "A linear programming bound for codes in a 2-access binary erasure channel",

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.",

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

year = "1981",

doi = "10.1007/978-3-7091-2900-5\_8",

language = "English",

isbn = "978-3-211-81612-7",

series = "CISM Courses and Lectures",

publisher = "Springer",

pages = "243--258",

editor = "G. Longo",

booktitle = "Multi-user communication systems",

address = "Germany",

}

TY - CHAP

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

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

PY - 1981

Y1 - 1981

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-7091-2900-5_8

DO - 10.1007/978-3-7091-2900-5_8

M3 - Chapter

SN - 978-3-211-81612-7

T3 - CISM Courses and Lectures

SP - 243

EP - 258

BT - Multi-user communication systems

A2 - Longo, G.

PB - Springer

CY - Vienna

ER -

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

Abstract

Publication series

Access to Document

Fingerprint

Cite this