Bounds on the achievable rates of block coding for a memoryless multiple-access channel

DOI10.1109/TIT.1978.1055860zbMath0369.94013MaRDI QIDQ4146672

Tadao Kasami, Shu Lin

Publication date: 1978

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items (1)

An Upper Bound on the Sizes of Multiset-Union-Free Families

This page was built for publication: Bounds on the achievable rates of block coding for a memoryless multiple-access channel