Results 131 to 140 of about 42,043 (174)

Galba truncatula: Distribution, Presence in Fountains and Identification of Factors Related to Its Occurrence in Bulgaria. [PDF]

Animals (Basel)
Georgieva K, Neov B.
europepmc   +1 more source

Trust-building as a Keystone Activity in Beaver-related Restoration Practice. [PDF]

Environ Manage
Erickson BD, Jones MS.
europepmc   +1 more source

Change in Urine Albumin-Creatinine Ratio and Occurrence of Hyperkalemia in Patients Initiating Finerenone in the USA: A Cohort Study from the FOUNTAIN Platform.

Nephron
Kovesdy CP, Ebert N, Vizcaya D, Walsh M, Kosiborod MN, Layton JB, Ziemiecki R, Johannes CB, Pladevall-Vila M, Gee PO, Jefferson N, Chicoye A, Lopes M, Thapa BB, Curhan G, Rangel L, Bhartia M, Liu F, Farjat AE, Oberprieler NG.   +19 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Towards Fountain Codes

Wireless Personal Communications, 2014
Fountain codes are a new class of codes originally designed for robust and scalable transmission of data over lossy computer networks. Binary Fountain codes such as Luby transform codes are a class of erasure codes which have demonstrated an asymptotic performance close to the Shannon limit when decoded with the belief propagation algorithm.
Seyed Masoud Mirrezaei, Karim Faez, Shahram Yousefi   +2 more
openaire   +1 more source

Concatenated fountain codes

2009 IEEE International Symposium on Information Theory, 2009
This paper investigates fountain communication over discrete-time memoryless channels. Fountain error exponent achievable by linear complexity concatenated fountain codes is derived.
Zheng Wang, Jie Luo
openaire   +1 more source

Coding for a network coded fountain

2011 IEEE International Symposium on Information Theory Proceedings, 2011
Batched sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network
Shenghao Yang, Raymond W. Yeung
openaire   +1 more source

Trapping Sets of Fountain Codes

IEEE Communications Letters, 2010
The remarkable results of Fountain codes over the binary erasure channel (BEC) have motivated research on their practical implementation over noisy channels. Trapping sets are a phenomenon of great practical importance for certain graph codes on noisy channels.
Vivian Lucia Orozco, Shahram Yousefi
openaire   +1 more source

Capacity approaching analog fountain codes

2014 Australian Communications Theory Workshop (AusCTW), 2014
In this paper, we propose an analog fountain code (AFC) to approach the capacity of the Gaussian channel in a wide range of signal to noise ratios (SNRs). The proposed code is rateless as the number of the generated coded symbols is potentially limitless; thus, enabling the transmitter to automatically adapt to the channel condition and sending as many
Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic   +2 more
openaire   +1 more source

A joint dedupe-fountain coded archival storage

2017 IEEE International Conference on Communications (ICC), 2017
An erasure-coded archival file storage system is presented using a chunk-based deduplication mechanism and fountain codes for space/time efficient operation. Unlike traditional archival storage, this proposal considers the deduplication operation together with correction coding in order to provide a reliable storage solution.
Arslan, Şuayb Şefik, Arslan, Şefik Şuayb, Göker, Turguy, Wideman, Rod   +3 more
openaire   +2 more sources