71 search results - page 6 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variabl...
TIT
2002
13 years 7 months ago
2002
One method for communicating with multiple antennas is to encode the transmitted data differentially using unitary matrices at the transmitter, and to decode differentially withou...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...