Sciweavers

181 search results - page 17 / 37
» On the Number of Errors Correctable with Codes on Graphs
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Alamouti Space-Time Coded OFDM Systems in Time- and Frequency-Selective Channels
Abstract— We propose low-complexity equalizers for Alamouti space-time coded orthogonal frequency-division multiplexing (OFDM) systems in time- and frequency-selective channels, ...
Kun Fang, Geert Leus, Luca Rugini
IPPS
2010
IEEE
13 years 4 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
PODC
2010
ACM
13 years 9 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...
FOCS
2003
IEEE
14 years 20 days ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
DCC
2002
IEEE
14 years 7 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic