- The design of embedded computing systems faces a serious productivity gap due to the increasing complexity of their hardware and software components. One solution to address this...
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fo...
Andreas F. Molisch, Neelesh B. Mehta, Jonathan S. ...
Run-length codes and their variants have recently been shown to be very effective for compressing system-on-achip (SOC) test data. In this paper, we analyze the Golomb code, the c...
Anshuman Chandra, Krishnendu Chakrabarty, Rafael A...
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...