Sciweavers

1016 search results - page 16 / 204
» Linear error-block codes
Sort
View
DCC
2005
IEEE
13 years 9 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 2 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
INFOCOM
2010
IEEE
13 years 6 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
TWC
2010
13 years 2 months ago
Linear precoding of STBC over correlated Ricean MIMO channels
A linear precoder is designed to minimize an upper bound of the pairwise error probability (PEP) when using arbitrary space-time block codes (STBC) over correlated Ricean fading c...
Manav R. Bhatnagar, Are Hjørungnes