Name
Abstract | ||
|---|---|---|
Two sets of 0-1 vectors of fixed length form a uniquely decodeable code pair if their Cartesian product is of the same size as their sumset, where the addition is pointwise over integers. For the size of the sumset of such a pair, van Tilborg has given an upper bound in the general case. Urbanke and Li, and later Ordentlich and Shayevitz, have given better bounds in the unbalanced case, that is, w... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2017.2688378 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Upper bound,Computer science,Electronic mail,Adders,Information technology,Hypercubes,Entropy | Conference | 64 |
Issue | ISSN | Citations |
2 | 0018-9448 | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| per austrin | 1 | 187 | 18.31 |
| Petteri Kaski | 2 | 912 | 66.03 |
| Mikko Koivisto | 3 | 803 | 55.81 |
| Jesper Nederlof | 4 | 294 | 24.22 |