RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1985 Volume 21, Issue 1, Pages 105–109 (Mi ppi977)
Ņorrespondence

Codes for a Two-User Adder Channel

G. G. Khachatryan


Abstract: We give a method for constructing $\delta$-decodable pairs of codes for a binary two-user adder channel. We present examples of codes with prescribed $\delta$ with rates beyond the time-sharing bound.

UDC: 621.391.15

Received: 11.01.1983
Revised: 11.04.1983



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025