DocumentCode
936421
Title
Upper bounds on
for a uniquely decodable code pair
for a two-access binary adder channel
Author
Van Tilborg, Henk G A
Volume
29
Issue
3
fYear
1983
fDate
5/1/1983 12:00:00 AM
Firstpage
386
Lastpage
389
Abstract
An algebraic and a combinatorial upper bound are derived on
given the code
, where
is a uniquely decodable code pair
for a two-access binary adder channel. A uniquely decodable code with rate pair
is also described.
given the code
, where
is a uniquely decodable code pair
for a two-access binary adder channel. A uniquely decodable code with rate pair
is also described.Keywords
Block coding; Multiaccess communication; Algebra; Decoding; Hamming weight; Information theory; Mathematics; Polynomials; Terminology; Time sharing computer systems; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1983.1056667
Filename
1056667
Link To Document