80 search results - page 12 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
TCOM
2008
14 years 9 months ago
2008
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
SIAMCO
2010
14 years 7 months ago
2010
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...