Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel

DOI10.1109/TIT.1983.1056614zbMath0519.94003MaRDI QIDQ3671037

Saburo Yamamura, Tadao Kasami, Victor K. Wei, Shu Lin

Publication date: 1983

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

zbMATH Keywords

synchronizing sequencesindependent set problemuniquely decodable codesmulti-user communicationmultiple-access communicationDeaett-Wolf codesdelta-decodable codesindependence number of a simple graphlower bounds on the achievable ratesnonsynchronized adder channelsynchronized adder channeltwo-user multiple-access binary adder channel

Mathematics Subject Classification ID

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

Related Items (2)

An Upper Bound on the Sizes of Multiset-Union-Free Families ⋮ On some connections between permutations and coding

This page was built for publication: Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel