Upper bounds on|C_2|for a uniquely decodable code pair(C_1, C_2)for a two-access binary adder channel
Author:
- H. van TilborgHTH. van Tilborg
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (3) , 386-389
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder ChannelIBM Journal of Research and Development, 1980
- Decoding of lineardelta-decodable codes for a multiple- access channel (Corresp.)IEEE Transactions on Information Theory, 1978
- Bounds on the achievable rates of block coding for a memoryless multiple-access channelIEEE Transactions on Information Theory, 1978
- An upper bound for codes in a two-access binary erasure channel (Corresp.)IEEE Transactions on Information Theory, 1978
- Coding for a multiple-access channelIEEE Transactions on Information Theory, 1976