New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3 \le T \le 5

DOI10.1109/TIT.2006.890692MaRDI QIDQ3548169zbMATH OpenFDO

Authors Lasse Kiviluoto, Patric R. J. Östergård

Publication date 21 December 2008

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

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

zbMATH Keywords

Adder channelmultiuser channeluniquely decodable (UD) codezero-error capacity

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Construction of uniquely decodable codes for the two-user binary adder channel
• A family of good uniquely decodable code pairs for the two-access binary adder channel
• A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel
• Upper bound for uniquely decodable codes in a binary input N-user adder channel
• Further results on coding for T-user multiple-access channels (Corresp.)

Cited in

(5)

• A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel
• A family of good uniquely decodable code pairs for the two-access binary adder channel
• scientific article; zbMATH DE number 26836 (Why is no real title available?)
• Upper bound for uniquely decodable codes in a binary input N-user adder channel
• Construction of uniquely decodable codes for the two-user binary adder channel

This page was built for publication: New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$

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