Sciweavers

716 search results - page 29 / 144
» Algorithmic Issues in Coding Theory
Sort
View
CORR
2004
Springer
110views Education» more  CORR 2004»
15 years 2 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi
WICON
2008
15 years 3 months ago
Stability regions of two-way relaying with network coding
We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermed...
Ertugrul Necdet Ciftcioglu, Aylin Yener, Randall B...
CC
2004
Springer
15 years 7 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
ICDCS
2009
IEEE
15 years 9 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 3 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty