DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We a...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
We study the problem of the reconstruction of a Gaussian field defined in [0, 1] using N sensors deployed at regular intervals. The goal is to quantify the total data rate require...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Asymptotically optimal bit allocation among a set of quantizers for a finite collection of sources was determined in 1963 by Huang and Schultheiss. Their solution, however, gives ...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Abstract--We study the entropy rate of pattern sequences of stochastic processes, and its relationship to the entropy rate of the original process. We give a complete characterizat...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...