71 search results - page 4 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
FOCS
2002
IEEE
14 years 12 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
TIT
2008
13 years 7 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
TIT
2008
13 years 7 months ago
2008
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initiall...