Sciweavers

3373 search results - page 130 / 675
» Linear transformations on codes
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Design of UEP-based MSE-minimizing rateless codes for source-channel coding
This paper proposes a method to optimize the performance of tandem source–channel coding with respect to the mean-squared error by exploiting the unequal error protection coding...
Amirpasha Shirazinia, Lei Bao, Mikael Skoglund
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 3 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap
126
Voted
DCC
2004
IEEE
16 years 3 months ago
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
Jing (Tiffany) Li, Zhenyu Tu, Rick S. Blum
159
Voted
LCTRTS
2007
Springer
15 years 9 months ago
Combining source-to-source transformations and processor instruction set extensions for the automated design-space exploration o
Industry’s demand for flexible embedded solutions providing high performance and short time-to-market has led to the development of configurable and extensible processors. The...
Richard Vincent Bennett, Alastair Colin Murray, Bj...
120
Voted
CTRSA
2010
Springer
152views Cryptology» more  CTRSA 2010»
15 years 6 months ago
Differential Cache-Collision Timing Attacks on AES with Applications to Embedded CPUs
This paper proposes a new type of cache-collision timing attacks on software implementations of AES. Our major technique is of differential nature and is based on the internal cryp...
Andrey Bogdanov, Thomas Eisenbarth, Christof Paar,...