Sciweavers

495 search results - page 35 / 99
» Capacity of Non-Malleable Codes
Sort
View
ISCA
1997
IEEE
78views Hardware» more  ISCA 1997»
14 years 17 days ago
Trading Conflict and Capacity Aliasing in Conditional Branch Predictors
As modern microprocessors employ deeper pipelines and issue multiple instructions per cycle, they are becoming increasingly dependent on accurate branch prediction. Because hardwa...
Pierre Michaud, André Seznec, Richard Uhlig
TSP
2008
111views more  TSP 2008»
13 years 9 months ago
Coding Schemes for User Cooperation in Low-Power Regimes
We consider the design of cooperation coding schemes for a two-user multi-access channel (MAC). In particular, we consider two block Markov coding schemes, namely, the multiplexed...
Guosen Yue, Xiaodong Wang, Zigui Yang, Anders H&os...
STOC
2000
ACM
123views Algorithms» more  STOC 2000»
14 years 17 days ago
List decoding algorithms for certain concatenated codes
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
Venkatesan Guruswami, Madhu Sudan
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 3 months ago
Cross-Layer Design Based Code Family Extension for CC/DS-CDMA Systems
Abstract— A complete complementary codes based direct sequence code division multiple access (CC/DS-CDMA) system was recently proposed to offer isotropic interference free transm...
Li-Peng Wang, Yang Yang, Yonghua Song
IEEEMSP
2002
IEEE
166views Multimedia» more  IEEEMSP 2002»
14 years 1 months ago
Joint source-channel coding of binary sources with side information at the decoder using IRA codes
— We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the ...
Angelos D. Liveris, Zixiang Xiong, Costas N. Georg...