Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Henk C. A. van Tilborg. An upper bound for codes in a two-access binary erasure channel (Corresp.). IEEE Transactions on Information Theory, 24(1):112-116, 1978. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An upper bound for codes for the noisy two-access binary adder channelHenk C. A. van Tilborg. TIT, 32(3):436, 1986. Upper bounds on |C::2::| for a uniquely decodable code pair (C::1::, C::2::) for a two-access binary adder channelHenk C. A. van Tilborg. TIT, 29(3):386-389, 1983.
The following publications are possibly variants of this publication: