Upper bounds on |C2| for a uniquely decodable code pair (C1, C2) for a two-access binary adder channel
暂无分享,去创建一个
[1] Shu Lin,et al. Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel , 1980, IBM J. Res. Dev..
[2] Tadao Kasami,et al. Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel , 1983, IEEE Trans. Inf. Theory.
[3] Shu Lin,et al. Decoding of linear Delta -decodable codes for a multiple- access channel (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[4] TADAO KASAMI,et al. Bounds on the achievable rates of block coding for a memoryless multiple-access channel , 1978, IEEE Trans. Inf. Theory.
[5] Rudolf Ahlswede,et al. Multi-way communication channels , 1973 .
[6] Jacob Wolfowitz,et al. Multiple Access Channels , 1978 .
[7] Henk C. A. van Tilborg,et al. An upper bound for codes in a two-access binary erasure channel (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[8] Shu Lin,et al. Coding for a multiple-access channel , 1976, IEEE Trans. Inf. Theory.