Coding for Adder Channels

DOI10.1007/978-1-4615-2694-0_6MaRDI QIDQ4857226zbMATH OpenOpenAlexFDO

Authors Ian Blake

Publication date 11 January 1996

Published in Communications and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4615-2694-0_6

zbMATH Keywords

adder channelsinformal surveymultiaccess channel

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Nearly optimal multiuser codes for the binary adder channel
• Coding for the Multiple-Access Adder Channel
• Upper bound for uniquely decodable codes in a binary input N-user adder channel
• scientific article; zbMATH DE number 3910301
• Publication:4945063

Cited in

(10)

• Code volume boundaries in the additive channel
• scientific article; zbMATH DE number 3843653 (Why is no real title available?)
• scientific article; zbMATH DE number 3910301 (Why is no real title available?)
• scientific article; zbMATH DE number 3948145 (Why is no real title available?)
• scientific article; zbMATH DE number 4031571 (Why is no real title available?)
• scientific article; zbMATH DE number 721901 (Why is no real title available?)
• Upper bound for uniquely decodable codes in a binary input N-user adder channel
• A multiuser k-ary code for the noisy multiple-access adder channel
• scientific article; zbMATH DE number 1420991 (Why is no real title available?)
• Coding for the Multiple-Access Adder Channel

This page was built for publication: Coding for Adder Channels

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