Code construction for the T-user noiseless adder channel

DOI10.1109/18.705572MaRDI QIDQ4701169zbMATH OpenOpenAlexFDO

Authors Gurgen Khachatrian, Samvel S. Martirossian

Publication date 21 November 1999

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

Full work available at URL https://doi.org/10.1109/18.705572

zbMATH Keywords

difference matrixmultiple-accessnoiseless adder channelrateuniquely decodable codes

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(4)

• scientific article; zbMATH DE number 4031571 (Why is no real title available?)
• A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
• Nearly optimal multiuser codes for the binary adder channel
• Signature codes for noisy multiple access adder channel

This page was built for publication: Code construction for the T-user noiseless adder channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701169)