Abstract
The binary input N-user adder channel models a communication media accessed simultaneously by N users. Each user transmits a binary codeword of length n chosen from its codebook and the channel output consists of a componentwise arithmetic sum of the binary digits. Van Tilborg (1978) gave an upper bound on the size of a uniquely decodable code for the two-user case. His work is generalized here to the N-user case. The results give interesting information on the existence and properties of such codes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
