8 search results - page 1 / 2 » Bounds on Redundancy in Constrained Delay Arithmetic Coding |
DCC
2007
IEEE
14 years 3 months ago
2007
IEEE
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
DCC
2008
IEEE
14 years 3 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
IOLTS
2003
IEEE
13 years 9 months ago
2003
IEEE
Fault tolerance requires the inclusion of redundant information. In this paper an on-line error detecting adder is presented in which the redundant information serves a dual purpo...
TIT
2008
13 years 4 months ago
2008
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...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—MAC layer random network coding (MRNC) was proposed in [1] as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a high...