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.
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 | |
Publication status | Published - 1981 |
Publication series
Name | CISM Courses and Lectures |
---|---|
Volume | 265 |
ISSN (Print) | 0254-1971 |