Title :
An upper bound for codes in a two-access binary erasure channel (Corresp.)
Author :
Van Tilborg, Henk C.
fDate :
1/1/1978 12:00:00 AM
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.
Keywords :
Coding; Multiple-access communications; Decoding; Mathematics; Propulsion; Space technology; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1978.1055814
