Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
From MaRDI portal
Publication:3671037
DOI10.1109/TIT.1983.1056614zbMath0519.94003MaRDI QIDQ3671037
Victor K. Wei, Shu Lin, Tadao Kasami, Saburo Yamamura
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
synchronizing sequences; independent set problem; uniquely decodable codes; multi-user communication; multiple-access communication; Deaett-Wolf codes; delta-decodable codes; independence number of a simple graph; lower bounds on the achievable rates; nonsynchronized adder channel; synchronized adder channel; two-user multiple-access binary adder channel
94B35: Decoding
94A40: Channel models (including quantum) in information and communication theory
94A24: Coding theorems (Shannon theory)
Related Items