We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Code size has always been an important issue for all embedded applications as well as larger systems. Code compression techniques have been devised as a way of battling bloated co...
We analyse the prequential plug-in codes relative to one-parameter exponential families M. We show that if data are sampled i.i.d. from some distribution outside M, then the redund...