Sciweavers

1399 search results - page 215 / 280
» Multi-party Finite Computations
Sort
View
DCC
2008
IEEE
16 years 6 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
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....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
DCC
2007
IEEE
16 years 6 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas
DCC
2005
IEEE
16 years 6 months ago
Quantization of Multiple Sources Using Integer Bit Allocation
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 ...
Benjamin Farber, Kenneth Zeger
DCC
2002
IEEE
16 years 6 months ago
Zero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
Ertem Tuncel, Prashant Koulgi, Shankar L. Regunath...
ICC
2009
IEEE
239views Communications» more  ICC 2009»
16 years 1 months ago
An Analytical Approach for Throughput Evaluation of Wireless Network Coding
In this paper, we propose a new analytical model for throughput evaluation of wireless network coding. This new approach is based on a probabilistic viewpoint on network coding, i....
Mohammad H. Amerimehr, Farid Ashtiani, Mohammad Ba...