TY - JOUR
T1 - A family of good uniquely decodable code pairs for the two-access binary adder channel
AU - Coebergh van den Braak, P.A.B.M.
AU - Tilborg, van, H.C.A.
PY - 1985
Y1 - 1985
N2 - An explicit construction is presented of uniquely decodable code pairs for the two-access binary erasure channel. Through a computer search we found many code pairs coming from this construction with a rate pair above the nonconstructive lower bound known in the literature. Also presented is a simple uniquely decodable code pair, with a high rate pair, found by a different method.
AB - An explicit construction is presented of uniquely decodable code pairs for the two-access binary erasure channel. Through a computer search we found many code pairs coming from this construction with a rate pair above the nonconstructive lower bound known in the literature. Also presented is a simple uniquely decodable code pair, with a high rate pair, found by a different method.
U2 - 10.1109/TIT.1985.1057004
DO - 10.1109/TIT.1985.1057004
M3 - Article
VL - 31
SP - 3
EP - 9
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 1
ER -