Construction of uniquely decodable codes for the two-user binary adder channel

DOI10.1109/18.746834zbMATH Open0947.94009OpenAlexW2123114258MaRDI QIDQ4701281FDOQ4701281

Authors: V. B. Balakirskij, Rudolf Ahlswede 

Publication date: 21 November 1999

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

Full work available at URL: https://research.tue.nl/nl/publications/93692a29-aeac-4f42-b1ca-1c228e73b404

Recommendations

• A family of good uniquely decodable code pairs for the two-access binary adder channel
• New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$
• scientific article; zbMATH DE number 26836
• scientific article; zbMATH DE number 3948145

zbMATH Keywords

uniquely decodable codesmultiple-access channelsbinary adder channel

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited In (10)

• Title not available (Why is that?)
• Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel
• A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel
• New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$
• A family of good uniquely decodable code pairs for the two-access binary adder channel
• A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some families of zero- error block codes for the two-user binary adder channel with feedback
• An upper bound on the sizes of multiset-union-free families

This page was built for publication: Construction of uniquely decodable codes for the two-user binary adder channel

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