Please use this identifier to cite or link to this item:
Coding for a T-user multiple-access channel
|uhm_phd_7801043_uh.pdf||Version for UH users||1.81 MB||Adobe PDF||View/Open|
|uhm_phd_7801043_r.pdf||Version for non-UH users. Copying/Printing is not permitted||1.84 MB||Adobe PDF||View/Open|
|Title:||Coding for a T-user multiple-access channel|
Data transmission systems
|Abstract:||Coding schemes for the discrete memoryless T-user adder channel are investigated in this paper. First, the capacity region of the noiseless T-user adder channel, and the maximal achievable rate for T-user uniquely decodable codes are derived. Second, code constructions are presented, including a class of T-user uniquely decodable codes with rates asymptotically equal to the maximal achievable value. A decoding algorithm for these codes is also presented. Finally, a class of T-user error-correcting codes for the noisy adder channel is constructed.|
Thesis (Ph. D.)--University of Hawaii at Manoa, 1977.
Bibliography: leaves 93-95.
vii, 95 leaves ill
|Rights:||All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.|
|Appears in Collections:||Ph.D. - Electrical Engineering|
Please email email@example.com if you need this content in an ADA-compliant format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.