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 language | English |
|---|---|
| Pages (from-to) | 112-116 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 24 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1978 |