Abstract | ||
---|---|---|
New uniquely decodable (UD) codes for 3-, 4-, and 5-user binary adder channels are obtained in a computer search. These codes improve the highest known rate of UD codes for such channels to (log2/600) 6ap1.5381,1.75, and (log2/192)4ap1.8962, respectively |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/TIT.2006.890692 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Decoding,Upper bound,H infinity control | Journal | 53 |
Issue | ISSN | Citations |
3 | 0018-9448 | 3 |
PageRank | References | Authors |
0.41 | 5 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lasse Kiviluoto | 1 | 5 | 1.15 |
Patric R. J. Östergård | 2 | 609 | 70.61 |