71 search results - page 5 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
TIT
2002
13 years 7 months ago
2002
Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens ...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...