A family of good uniquely decodable code pairs for the two-access binary adder channel
Authors:
- P.C. van Den BraakPBP.C. van Den Braak
- H. van TilborgHTH. van Tilborg
- 1 January 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (1) , 3-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Upper bounds on|C_2|for a uniquely decodable code pair(C_1, C_2)for a two-access binary adder channelIEEE Transactions on Information Theory, 1983
- Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channelIEEE Transactions on Information Theory, 1983
- 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