Results 131 to 140 of about 202,859 (188)
Opioid use after adult liver transplantation: Incidence, high-risk use, and adverse events in a large US cohort. [PDF]
Lieber SR +19 more
europepmc +1 more source
Syntheses and crystal structures of <i>catena</i>-poly[[di-iodido-zinc(II)]-μ-2,3-di-methyl-pyrazine-κ<sup>2</sup> <i>N</i> <sup>1</sup>:<i>N</i> <sup>4</sup>] and aqua-(2,3-di-methyl-pyrazine-κ<i>N</i>)di-iodidozinc(II)-2,3-di-methyl-pyrazine-water (2/1/1). [PDF]
Näther C, Bhosekar G.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2006 IEEE International Symposium on Information Theory, 2006
This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols
Srinath Puducheri +2 more
openaire +2 more sources
This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols
Srinath Puducheri +2 more
openaire +2 more sources
LT-AF codes: LT codes with Alternating Feedback
2013 IEEE International Symposium on Information Theory, 2013LT codes are capacity achieving and flexible rateless codes that need a single-bit feedback to inform the encoder of the successful decoding. However, this weak feedback channel remains unused when the transmission is in progress. In addition, although LT codes are asymptotically capacity achieving, their performance significantly degrades for short ...
Ali Talari, Nazanin Rahnavard
openaire +1 more source
2008 42nd Annual Conference on Information Sciences and Systems, 2008
It is common in data transmissions that some information is more important than others. This is especially true in space communications where mission critical information or science data are high priority. In this work, we propose a simple yet constructive scheme to send high priority data reliably and efficiently using Luby transform (LT) codes.
Simon S. Woo, Michael K. Cheng
openaire +1 more source
It is common in data transmissions that some information is more important than others. This is especially true in space communications where mission critical information or science data are high priority. In this work, we propose a simple yet constructive scheme to send high priority data reliably and efficiently using Luby transform (LT) codes.
Simon S. Woo, Michael K. Cheng
openaire +1 more source
Graph-based LT and raptor codes
2008 IEEE International Symposium on Information Theory, 2008This paper deals with LT and raptor codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the average amount of redundancy needed to decode the information bits. We consider the new class of graph-based LT and raptor codes, we analyze
Tarable Alberto, Benedetto Sergio
openaire +4 more sources
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking, 2010
In this work rateless codes are used as the key content delivery mechanism for the design of a novel P2P live streaming application. Novel algorithms for the management of the peers' resources and the exploitation of the rateless codes for content delivery in a mesh based overlay are presented.
MAGNETTO, ANDREA +3 more
openaire +3 more sources
In this work rateless codes are used as the key content delivery mechanism for the design of a novel P2P live streaming application. Novel algorithms for the management of the peers' resources and the exploitation of the rateless codes for content delivery in a mesh based overlay are presented.
MAGNETTO, ANDREA +3 more
openaire +3 more sources
IEEE Communications Letters, 2008
We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives.
null Xiaojun Yuan, null Li Ping
openaire +1 more source
We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives.
null Xiaojun Yuan, null Li Ping
openaire +1 more source

