363 search results - page 8 / 73 » Code Generation for Polynomial Multiplication |
TIT
2008
13 years 7 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
SAIG
2000
Springer
13 years 11 months ago
2000
Springer
Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper presents a coding scheme suitable for transmission of multimedia data over mixed internet and wireless channels. To resist packet losses and provide good com...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Distributed applications typically interact with a number of heterogeneous and autonomous components that evolve independently. Methodical development of such applications can ben...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...