Relevant bibliographies by topics / Fountain codes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Fountain codes'

Author: Grafiati
Published: 4 June 2021
Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fountain codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fountain codes"

1

MacKay, D. J. C. "Fountain codes." IEE Proceedings - Communications 152, no. 6 (2005): 1062. http://dx.doi.org/10.1049/ip-com:20050237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mirrezaei, Seyed Masoud, Karim Faez, and Shahram Yousefi. "Towards Fountain Codes." Wireless Personal Communications 77, no. 2 (January 9, 2014): 1533–62. http://dx.doi.org/10.1007/s11277-013-1597-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Asteris, Megasthenis, and Alexandros G. Dimakis. "Repairable Fountain Codes." IEEE Journal on Selected Areas in Communications 32, no. 5 (May 2014): 1037–47. http://dx.doi.org/10.1109/jsac.2014.140522.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

KIRIAN, M. L., G. MEREGILLANO, D. GENNETTE, and J. M. WEINTRAUB. "Multi-jurisdictional investigation of interactive fountain-associated cryptosporidiosis and salmonellosis outbreaks." Epidemiology and Infection 136, no. 11 (January 16, 2008): 1547–51. http://dx.doi.org/10.1017/s0950268807000222.

Full text
Abstract:
SummaryInteractive water fountains are established sources of gastrointestinal infections yet most health codes fail to regulate their design and operation. This report describes multi-agency, concurrent interactive fountain-associated cryptosporidiosis and salmonellosis outbreak investigations and highlights the need for the adoption of appropriate regulations for interactive fountains.
APA, Harvard, Vancouver, ISO, and other styles
5

NOZAKI, Takayuki. "Zigzag Decodable Fountain Codes." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A, no. 8 (2017): 1693–704. http://dx.doi.org/10.1587/transfun.e100.a.1693.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

NOZAKI, Takayuki. "Zigzag Decodable Fountain Codes." IEICE ESS Fundamentals Review 13, no. 1 (July 1, 2019): 7–19. http://dx.doi.org/10.1587/essfr.13.1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kumar, Siddhartha, Eirik Rosnes, and Alexandre Graell i Amat. "Secure Repairable Fountain Codes." IEEE Communications Letters 20, no. 8 (August 2016): 1491–94. http://dx.doi.org/10.1109/lcomm.2016.2574355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhao, Yuli, Yin Zhang, Francis C. M. Lau, Hai Yu, and Zhiliang Zhu. "Improved online fountain codes." IET Communications 12, no. 18 (November 20, 2018): 2297–304. http://dx.doi.org/10.1049/iet-com.2018.5486.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Harb, Ali Bazzi, Hiba, Zahraa Younes, Majd Ghareeb, and Samih Abdulnabi. "Fountain Codes: LT And Raptor Codes Implementation." International Journal of Engineering Research and Applications 07, no. 01 (January 2017): 97–102. http://dx.doi.org/10.9790/9622-07010197102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Peng, Xiao Feng, Yi Yang, Chuan Yang, and Kai Li Wang. "Research on Data Transmission Technology Based on Raptor Code in Wireless Sensor Networks." Applied Mechanics and Materials 442 (October 2013): 538–43. http://dx.doi.org/10.4028/www.scientific.net/amm.442.538.

Full text
Abstract:
Wireless sensor network is a data centric distributed self-organizing network. The transmission of data is the most important task of it. It is a topic worthy of study that how to ensure the reliability of data transmission in any environment .Fountain codes algorithm is simple, and has no ratio. It is very suitable for coding scheme for Wireless Sensor Networks. This paper mainly studies the Fountain codes of Raptor codes in wireless sensor network data transmission technology, and gives the concrete scheme and implementation ways. The application of this technology can improve the reliability of data transmission and transmission efficiency. It overcome the problems of very large packet error codec technology traditional rate and the decoding success rate.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Fountain codes"

1

Hu, Ketai. "Reduced-complexity decoding of fountain codes." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27254.

Full text
Abstract:
Fountain codes are a universal class of rateless codes originally designed for erasure channels. Naturally adapting to channel states without channel knowledge at the transmitter, Fountain codes have recently been demonstrated also as an appealing solution for communication over fading channels. However, their relatively high decoding complexity limits their practical use in a wireless setting. In this thesis, we present a new decoding algorithm for Raptor codes---a type of Fountain codes---over fading channels, where the complexity is significantly reduced without sacrifice of performance.
APA, Harvard, Vancouver, ISO, and other styles
2

PAIBA, FRANKLIN ANTONIO SANCHEZ. "BIDIMENSIONAL FOUNTAIN CODES FOR ERASURE CHANNELS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=12457@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Esta dissertação aborda o estudo de códigos fontanais (códigos LT e códigos Raptor) que são uma classe de códigos criados para a transmissão de dados de maneira confiável e eficiente através de canais os quais podem ser modelados como canais com apagamento. Os códigos LT e códigos Raptor são denominados códigos fontanais, devido a que eles são uma boa aproximação para o conceito de fontanas digitais. Além disso, eles são classificados como códigos de taxa versátil, no sentido que o número de símbolos codificados que podem ser gerados a partir dos dados de entrada é potencialmente ilimitado. Códigos LT são capazes de recuperar, com probabilidade maior do que (1 − delta), um conjunto de k símbolos de entrada a partir de quaisquer k + O((raiz quadrada de k)(ln(2))(k/delta)) símbolos codificados recebidos, com uma média de O(k ln(k/delta)) operações XOR. Os códigos Raptor são uma extensão de códigos LT, na qual o processo de codificação é composto de duas etapas: um código de bloco de comprimento fixo (denominado pré- código) e um código LT com uma distribuição de graus apropriada. Investigou-se o desempenho dos códigos LT usando duas novas distribuições de graus (Sóliton Robusta Melhorada e Sóliton Robusta Truncada) e foi proposto um modelo de códigos LT Bidimensionais, na qual os símbolos de entrada são agrupados em forma de matriz. Neste esquema os blocos correspondentes às linhas da matriz são codificados usando um código LT e, em seguida, a matriz resultante tem suas colunas também codificadas usando um código LT. Ainda que a complexidade do esquema tenha sido dobrada o desempenho alcançado pelos códigos LT Bidimensionais superou o desempenho dos códigos LT convencionais para situações em que a qualidade do canal BEC é elevada.
Fountain Codes (LT Codes and Raptor Codes) are a class of codes proposed to efficient and reliably transmit data through Erasure Channels. LT Codes and Raptor Codes are a good approximation to the concept of digital fountain and as such are named as fountain codes. They are said to be rateless codes in the sense that the number of symbols produced by the encoder could grow, potentially, to infinite. With probability of success larger than (1−delta), a decoder of an LT code based scheme can recover the k transmitted symbols from any received block of k + O((square root k)(ln(2))(k/delta)) correct symbols with an average of O(k ln(k/delta)) XOR operations. Raptor codes are an extension of the LT codes idea, with a tandem scheme where a fixed length block code (namely a pre- code) is followed by an LT code that uses a properly chosen degree distribution. In this dissertation the performance of LT codes with two recently proposed degree distributions, the Improved Robust Soliton and the Truncated Soliton Robust Distribution were investigated. A new scheme called Bidimensional LT Codes, has been proposed. In this scheme the input symbols are structured in a matrix form and afterwards the blocks corresponding to the lines of the matrix are encoded with an LT code. The columns of the new matrix so obtained are next encoded with a similar LT code. The complexity of the new scheme is doubled and yet its performance only just surpasses that of the conventional LT scheme for high quality BEC.
APA, Harvard, Vancouver, ISO, and other styles
3

Nguyen, Dang Thanh. "Fountain codes for the wireless Internet." Thesis, University of Southampton, 2008. https://eprints.soton.ac.uk/64484/.

Full text
Abstract:
In this thesis, novel Foutain codes are proposed for transmission over wireless channels. The thesis concentrates on a specific version of Fountain codes, namely on Luby transform codes. More specifically, we consider their concatenation with classic error correction codes, yielding schemes, such as the concatenated Luby Transform and Bit Interleaved Coded Modulation using Iterative Decoding (LT-BICM-ID), the amalgamated Luby Transform and Generalized Low Density Parity Check (LT-GLDPC) code, or the Luby Transform coded Spatial Division Multiple Access (LT-SDMA) scenario considered. The thesis also investigates the potential of Systematic Luby Transform (SLT) codes using soft-bit decoding and analyses their Bit Error Ratio (BER) performance using EXtrinsic Information Transfer (EXIT) charts. SLT codes using different degree distributions and random integer packet index generation algorithms for creating the parity and information part of the SLT codeword are also investigated in this thesis. For the sake of improving both the BER performance and the diversity gain of Vertical Bell Laboratories Layered Space Time (V-BLAST) schemes, in this thesis a SLT coded V-BLAST system having four transmit and four receive antennas is proposed. Finally, A Hybrid Automatic Repeat reQuest (H-ARQ) SLT coded modulation scheme is designed in this thesis, where SLT codes are used both for correcting erroneous bits and for detecting as well as retransmitting erroneous Internet Protocol (IP) based packets. Erroneous IP packet detection is implemented using syndrome checking with the aid of the SLT codes’ Parity Check Matrix (PCM). Optimizing the mapping of SLT-encoded bits to modulated symbols and then using iterative decoding for exchanging extrinsic information between the SLT decoder and the demapper substantially improves the achievable Bit Error Ratio (BER) performance of the scheme.
APA, Harvard, Vancouver, ISO, and other styles
4

Lázaro, Blasco Francisco [Verfasser]. "Fountain Codes under Maximum Likelihood Decoding / Francisco Lázaro Blasco." München : Verlag Dr. Hut, 2017. http://d-nb.info/1137023546/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grobler, Trienko Lups. "Fountain codes and their typical application in wireless standards like edge." Diss., University of Pretoria, 2008. http://hdl.handle.net/2263/25381.

Full text
Abstract:
One of the most important technologies used in modern communication systems is channel coding. Channel coding dates back to a paper published by Shannon in 1948 [1] entitled “A Mathematical Theory of Communication”. The basic idea behind channel coding is to send redundant information (parity) together with a message to make the transmission more error resistant. There are different types of codes that can be used to generate the parity required, including block, convolutional and concatenated codes. A special subclass of codes consisting of the codes mentioned in the previous paragraph, is sparse graph codes. The structure of sparse graph codes can be depicted via a graphical representation: the factor graph which has sparse connections between its elements. Codes belonging to this subclass include Low-Density-Parity-Check (LDPC) codes, Repeat Accumulate (RA), Turbo and fountain codes. These codes can be decoded by using the belief propagation algorithm, an iterative algorithm where probabilistic information is passed to the nodes of the graph. This dissertation focuses on noisy decoding of fountain codes using belief propagation decoding. Fountain codes were originally developed for erasure channels, but since any factor graph can be decoded using belief propagation, noisy decoding of fountain codes can easily be accomplished. Three fountain codes namely Tornado, Luby Transform (LT) and Raptor codes were investigated during this dissertation. The following results were obtained:
  1. The Tornado graph structure is unsuitable for noisy decoding since the code structure protects the first layer of parity instead of the original message bits (a Tornado graph consists of more than one layer).
  2. The successful decoding of systematic LT codes were verified.
  3. A systematic Raptor code was introduced and successfully decoded. The simulation results show that the Raptor graph structure can improve on its constituent codes (a Raptor code consists of more than one code).
Lastly an LT code was used to replace the convolutional incremental redundancy scheme used by the 2G mobile standard Enhanced Data Rates for GSM Evolution (EDGE). The results show that a fountain incremental redundancy scheme outperforms a convolutional approach if the frame lengths are long enough. For the EDGE platform the results also showed that the fountain incremental redundancy scheme outperforms the convolutional approach after the second transmission is received. Although EDGE is an older technology, it still remains a good platform for testing different incremental redundancy schemes, since it was one of the first platforms to use incremental redundancy.
Dissertation (MEng)--University of Pretoria, 2008.
Electrical, Electronic and Computer Engineering
MEng
unrestricted
APA, Harvard, Vancouver, ISO, and other styles
6

Shirvanimoghaddam, Mahyar. "From binary to analog fountain codes: design, theory, and applications." Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/12584.

Full text
Abstract:
The focus of this thesis is on the design of rateless codes for wireless communications. Firstly, I present the design of the binary rateless codes for user cooperation scenarios. A novel partially coded cooperation scheme based on Raptor codes is proposed and analysed by using the AND-OR tree analytical approach. I formulate a degree optimization problem for both conventional and proposed coded cooperation strategies and show that the proposed scheme with optimized degree distribution outperforms the conventional scheme. Secondly, I propose a novel analog fountain code (AFC), where the modulated symbols are directly generated from information symbols in a linear fashion. The AFC can automatically adapt to the unknown wireless channel conditions without requiring channel state information at the transmitter side. It is shown that the AFC can approach the capacity of the Gaussian channel in a wide range of SNR values. Based on the principle of AFC, I then design the near-optimal massive random access scheme for machine to machine (M2M) communications to support a large number of access devices with different delay requirements. I formulate an optimization problem to optimize the access probability for each device and derive the optimal random transmission strategy. Simulation results show that the proposed scheme performs very close to the optimal coordinated scheme. Finally, the binary compressive sensing (CS) problem is studied and is reformulated by using AFCs. A simple verification based decoder is proposed for the noiseless case and the minimum number of measurements to successfully reconstruct the original sparse signal is obtained. I then show a practical application of the AFCS for the sparse event detection (SED) in wireless sensor networks and show that AFCS outperforms existing SED algorithms in terms of the probability of correct detection in different channel conditions even with a smaller number of measurements.
APA, Harvard, Vancouver, ISO, and other styles
7

Lim, Wen Jun. "Analysis and design of analog fountain codes for short packet communications." Thesis, The University of Sydney, 2022. https://hdl.handle.net/2123/29277.

Full text
Abstract:
Channel coding is at the heart of any communications systems and plays a key role in meeting the requirements of current and future wireless standards. The services defined by the 3rd Generation Partnership Project (3GPP) for fifth generation (5G) new radio, in particular ultra-reliable low-latency communication (URLLC) and massive machine type communication (mMTC), have very stringent requirements in terms of latency and reliability. Short packet communication is proved to be one of the solutions to achieve the latency requirement of future wireless communication systems due to shorter transmission-time interval. Therefore, designing robust and efficient short channel codes for URLLC and mMTC is of critical importance to design sustainable and efficient mobile communication systems. Traditional channel coding methods are not able to fulfil the requirements for Beyond 5G (B5G) or 6th generation (6G) mobile standards, which have a strong emphasis on bit-level granularity and flexibility. Rateless codes have been considered as viable candidates for short packet communication in URLLC and mMTC due to their rate-adaptive nature. Furthermore, the fact that rateless codes do not rely on channel state information (CSI) makes them stand out from traditional channel codes, which is an important characteristic to reduce transmission overhead. Analog fountain code (AFC) is a newly introduced rateless code, which has linear complexity in terms of encoding and decoding, and a capacity-approaching performance for a wide range of signal-to-noise ratios (SNRs). The code structure is simple; that is, the modulated information symbols are directly generated from information symbols in a linear manner. In this thesis, I will take a step forward to provide a comprehensive analysis and design of AFC for short packet communications. I first propose a density evolution (DE)-based framework, which tracks the evolution of the probability density function of the messages exchanged between AFC’s variable and check nodes in the belief propagation (BP) decoder. Based on the proposed DE framework, I formulate an optimisation problem to find the optimal weight set for AFC in order to minimise the bit error rate at a given SNR. Simulation results show the superiority of the AFC code design with optimised weight set compared to existing AFC designs in the literature. Next, I focus on the design of AFC in a short block length regime. In order to guarantee the performance of AFC in these conditions, a proper precoder is required. Therefore, the optimised weight set obtained from the proposed DE framework can be directly applied in the short block length regime with the aid of a precoder with powerful error correcting capability. Specifically, I use Bose, Chaudhuri, and Hocquenghem (BCH) codes with an ordered statistics decoder (OSD) and low-density parity check (LDPC) codes with the BP decoder. Simulation results show that low rate precoders offer better reliability across a wide range of SNRs compared to high-rate precoders. Additionally, the precoded AFC performs close to the normal approximation benchmark in the short block length regime over a wide range of SNRs. I also discuss the complexity of the AFC decoder and propose a threshold-based decoder to reduce it. Finally, I focus on the analysis and design of AFC in a multiple access channel. I present two encoding schemes, i.e., superposition coding and joint encoding, and two decoding schemes, i.e., successive interference cancellation and joint decoding, for multiple access AFC (MA-AFC). The process of joint encoding and the updating rules for joint decoding are explained in detail. I propose different combinations of encoding and decoding schemes for MA-AFC and evaluate their performance in terms of block error rate (BLER) to determine which combination has the best performance. Next, I propose a DE-based framework to track the evolution of messages exchanged between check nodes and variable nodes of MA-AFC under the joint decoding scheme. With the proposed DE framework, I formulate optimisation problems to find the optimal AFC code parameters, specifically the weight-set, which minimise the bit error rate at a given SNR. Simulation results show that the optimised AFC code outperforms the existing AFC code design in multiple access scenarios.
APA, Harvard, Vancouver, ISO, and other styles
8

Du, Toit F. J. "A fountain code forward error correction strategy for SensLAB applications." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86399.

Full text
Abstract:
Thesis (MScEng)--Stellenbosch University, 2014.
ENGLISH ABSTRACT: The discovery of sparse graph codes, used in forward error correction strate- gies, has had an unrivaled impact on Information theory over the past decade. A recent advancement in this field, called Fountain codes, have gained much attention due to its intelligent rate adaptivity, and lend itself to applications such as multicasting and broadcasting networks. These particular properties can be considered valuable in a wireless sensor network setting as it is capable of providing forward error correction, and the added conceptual network protocol related extensions. A wireless sensor network testbed in France, called SensLAB, provides an experimental facility for researchers to develop and evaluate sensor network protocols, aside from a simulation environment. Tremendous value can be added to the SensLAB community if an appropriate forward error correction design, such as Fountain codes, is deemed feasible for use on such a platform. This thesis investigates the use of Fountain codes, in a binary erasure channel environment, as a forward error correction strategy for the distribution of reliable data content over the SensLAB platform. A short message length LT code using two different decoding mechanisms were developed and evaluated for possible implementation. Furthermore, a short message length Raptor code was developed by using supplementary theory and optimisation techniques that permit scalability in terms of the message size. The results favoured the Raptor code design as it performs close to near optimal while still satisfying the rateless- and universality property, at low computational complexity.
AFRIKAANSE OPSOMMING: Die ontdekking van yl-grafiekkodes, van toepassing op foutkorreksie strategieë, het onlangs 'n ongeewenaarde impak op Informasieteorie gehad. In 'n onlangse vooruitgang in hierdie veld, genoem Fonteinkodes, word daar meer fokus geplaas op die intelligente tempo aanpassingsvermoë van hierdie kodes, wat nuttige toepassing kan inhou in multi-saai- en uitsaai netwerke. Hierdie eienskappe kan moontlik as waardevol beskou word in draadlose sensor netwerke weens die fout regstellingsvermoë en die bykomende konseptuele netwerk protokol verwante uitbreidings. 'n Draadlose sensor netwerk toetsplatvorm in Frankryk, genoem die SensLAB, bied navorsers die geleentheid om eksperimentele sensor netwerk protokolle te ontwikkel en te toets buite 'n tipiese simulasie-omgewing. Groot waarde kan bygevoeg word aan die SensLAB gemeenskap indien 'n geskikte foutkorreksie strategie ontwikkel word, soos Fonteinkodes, en as geskik beskou kan word vir hierdie platvorm. In hierdie tesis word Fonteinkodes saam met die SensLAB platvorm ondersoek, binne die raamwerk van 'n binêre verlieskanaal, om vir foutkorreksie oor die verspreiding van betroubare data in SensLAB op te tree. 'n Kort boodskap LT kode word voorgestel deur van twee verskillende dekoderings meganismes gebruik te maak. 'n Alternatief, genaamd Raptorkode, was ook ondersoek. 'n Raptorkode. 'n Kort boodskap Raptor kode, wat ontwikkel is met bykomende teorie en optimeringstegnieke, word ook voorgestel. Die bykomende tegnieke bied 'n skaleerbare boodskap lengte terwyl dit tempoloos en universeel bly, en lae kompleksiteit bied.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Xiaohan Sasha. "Investigation of Forward Error Correction Coding Schemes for a Broadcast Communication System." Thesis, University of Canterbury. Computer Science and Software Engineering, 2013. http://hdl.handle.net/10092/7902.

Full text
Abstract:
This thesis investigates four FEC (forward error correction) coding schemes for their suitability for a broadcast system where there is one energy-rich transmitter and many energy-constrained receivers with a variety of channel conditions. The four coding schemes are: repetition codes (the baseline scheme); Reed-Solomon (RS) codes; Luby-Transform (LT) codes; and a type of RS and LT concatenated codes. The schemes were tested in terms of their ability to achieve both high average data reception success probability and short data reception time at the receivers (due to limited energy). The code rate (Rc) is fixed to either 1/2 or 1/3. Two statistical channel models were employed: the memoryless channel and the Gilbert-Elliott channel. The investigation considered only the data-link layer behaviour of the schemes. During the course of the investigation, an improvement to the original LT encoding process was made, the name LTAM (LT codes with Added Memory) was given to this improved coding method. LTAM codes reduce the overhead needed for decoding short-length messages. The improvement can be seen for decoding up to 10000 number of user packets. The maximum overhead reduction is as much as 10% over the original LT codes. The LT-type codes were found to have the property that can both achieve high success data reception performance and flexible switch off time for the receivers. They are also adaptable to different channel characteristics. Therefore it is a prototype of the ideal coding scheme that this project is looking for. This scheme was then further developed by applying an RS code as an inner code to further improve the success probability of packet reception. The results show that LT&RS code has a significant improvement in the channel error tolerance over that of the LT codes without an RS code applied. The trade-off is slightly more reception time needed and more decoding complexity. This LT&RS code is then determined to be the best scheme that fulfils the aim in the context of this project which is to find a coding scheme that both has a high overall data reception probability and short overall data reception time. Comparing the LT&RS code with the baseline repetition code, the improvement is in three aspects. Firstly, the LT&RS code can keep full success rate over channels have approximately two orders of magnitude more errors than the repetition code. This is for the two channel models and two code rates tested. Secondly, the LT&RS code shows an exceptionally good performance under burst error channels. It is able to maintain more than 70% success rate under the long burst error channels where both the repetition code and the RS code have almost zero success probability. Thirdly, while the success rates are improved, the data reception time, measured in terms of number of packets needed to be received at the receiver, of the LT&RS codes can reach a maximum of 58% reduction for Rc = 1=2 and 158% reduction for Rc = 1=3 compared with both the repetition code and the RS code at the worst channel error rate that the LT&RS code maintains almost 100% success probability.
APA, Harvard, Vancouver, ISO, and other styles
10

Huang, Weizheng. "Investigation on Digital Fountain Codes over Erasure Channels and Additive White Gaussian Noise Channels." Ohio University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1336067205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Fountain codes"

1

Caire, Giuseppe, Shlomo Shamai, Amin Shokrollahi, and Sergio Verdú. "Fountain codes for lossless data compression." In Algebraic Coding Theory and Information Theory, 1–20. Providence, Rhode Island: American Mathematical Society, 2005. http://dx.doi.org/10.1090/dimacs/068/01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Apavatjrut, Anya, Claire Goursaud, Katia Jaffrès-Runser, and Jean-Marie Gorce. "Fountain Codes and Network Coding for WSNs." In Network Coding, 27–72. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118562819.ch2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yin, Rui-Na, and Ke-Bin Jia. "A Short-Wave Communication System Based on Fountain Codes." In Communications in Computer and Information Science, 262–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24999-0_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Wei, Yueyun Chen, and Yudong Yao. "Multi-point Cooperative Fountain Codes Multicast for LTE Cellular System." In Internet of Things, Smart Spaces, and Next Generation Networking, 216–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32686-8_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhou, Juan, Ying Shen, and Youxi Tang. "Peak-to-Average Power-Ratio Reduction Scheme Employing Fountain Codes." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 67–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30493-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Champel, Mary-Luc, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. "FoG: Fighting the Achilles’ Heel of Gossip Protocols with Fountain Codes." In Lecture Notes in Computer Science, 180–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05118-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Yue, Shushi Gu, Ye Wang, Juan Li, and Qinyu Zhang. "Repairable Fountain Codes with Unequal Repairing Locality in D2D Storage System." In Ad Hoc Networks, 272–81. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05888-3_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Yue, Shushi Gu, Ye Wang, Wei Xiang, and Qinyu Zhang. "Repairable Fountain Codes with Unequal Locality for Heterogeneous D2D Data Storage Networks." In Wireless and Satellite Systems, 514–28. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19153-5_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shao, Hanqin, Hongbo Zhu, and Junwei Bao. "Analysis and Design of Wireless Distributed Fountain Codes with Multiplicative Network Coding." In Machine Learning and Intelligent Communications, 250–64. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-66785-6_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shi, Pengcheng, Zhenyong Wang, and Dezhi Li. "Low Overhead Growth Degree Coding Scheme for Online Fountain Codes with Limited Feedback." In Wireless and Satellite Systems, 456–67. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-93398-2_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fountain codes"

1

MacKay, D. J. C. "Fountain codes." In IEE Seminar on Sparse-Graph Codes (Turbo Codes, Low Density Parity-Check Codes and Fountain Codes). IEE, 2004. http://dx.doi.org/10.1049/ic:20040504.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Zheng, and Jie Luo. "Concatenated fountain codes." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205958.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Asteris, Megasthenis, and Alexandros G. Dimakis. "Repairable Fountain codes." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283579.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fern�ndez-Hern�ndez, I., D. Calle, S. Cancela, A. Fern�ndez, R. Mart�nez, G. Seco-Granados, and P. Walker. "Fountain Codes for GNSS." In 30th International Technical Meeting of The Satellite Division of the Institute of Navigation (ION GNSS+ 2017). Institute of Navigation, 2017. http://dx.doi.org/10.33012/2017.15368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shirvanimoghaddam, Mahyar, Yonghui Li, and Branka Vucetic. "Multiple access analog fountain codes." In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6875217.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shirvanimoghaddam, Mahyar, Yonghui Li, and Branka Vucetic. "Capacity approaching analog fountain codes." In 2014 Australian Communications Theory Workshop (AusCTW). IEEE, 2014. http://dx.doi.org/10.1109/ausctw.2014.6766421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhu, Hongjie, Chao Zhang, and Jianhua Lu. "Designing of Fountain Codes with Short Code-Length." In Chengdu, China. IEEE, 2007. http://dx.doi.org/10.1109/iwsda.2007.4408410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pyndiah, R. "Block turbo codes: ten years later." In IEE Seminar on Sparse-Graph Codes (Turbo Codes, Low Density Parity-Check Codes and Fountain Codes). IEE, 2004. http://dx.doi.org/10.1049/ic:20040505.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Urbanke, R. "The quest for capacity-achieving codes." In IEE Seminar on Sparse-Graph Codes (Turbo Codes, Low Density Parity-Check Codes and Fountain Codes). IEE, 2004. http://dx.doi.org/10.1049/ic:20040506.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ng, S. X. "Integrated wireless multimedia turbo-transceiver design approaching the Rayleigh channel's capacity: interpreting Shannon's lessons in the turbo-era." In IEE Seminar on Sparse-Graph Codes (Turbo Codes, Low Density Parity-Check Codes and Fountain Codes). IEE, 2004. http://dx.doi.org/10.1049/ic:20040507.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Fountain codes' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography