By Topic

Upper bounds on |C_2| for a uniquely decodable code pair (C_1, C_2) for a two-access binary adder channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

An algebraic and a combinatorial upper bound are derived on |C_{2}| given the code C_{1} , where (C_{l}, C_{2}) is a uniquely decodable code pair (C_{1}, C_{2}) for a two-access binary adder channel. A uniquely decodable code with rate pair (0.5170, 0.7814) is also described.

Published in:

IEEE Transactions on Information Theory  (Volume:29 ,  Issue: 3 )