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

DOI10.1109/TIT.1983.1056614MaRDI QIDQ3671037zbMATHFDO

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

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

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

Cited in

(2)

• On some connections between permutations and coding
• An upper bound on the sizes of multiset-union-free families

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

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