Relevant bibliographies by topics / Luby transform code

Contents

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

Academic literature on the topic 'Luby transform code'

Author: Grafiati
Published: 4 June 2025
Last updated: 23 June 2025

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 'Luby transform code.'

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 "Luby transform code"

1

Wang, Lina, Hang Zhang, Yaoyao Li, and Tianyu An. "Partly systematic Luby transform codes based on improved progressive edge-growth algorithm for Mars communications." Journal of Algorithms & Computational Technology 12, no. 3 (2018): 200–207. http://dx.doi.org/10.1177/1748301818770082.

Full text
Abstract:
The Luby transform code is a forward error correction code and was originally designed for the erasure channel. In this paper, the Luby transform codes over the Mars communication channel are investigated. To guarantee the reliable data transmission over the Mars communication channel which are usually affected by fading and noises, the progressive edge-growth algorithm is improved and used in for encoding the Luby transform codes. And then a partly systematic Luby transform code with an improved progressive edge-growth algorithm is designed to improve the error propagation phenomenon in Mars communications. Performance evaluations of the designed partly systematic Luby transform code based on the random graph, PEG and improved progressive edge-growth algorithms, respectively, are conducted through a series of simulations. Simulation results show that the performance of the partly systematic Luby transform code based on the improved progressive edge-growth algorithm outperforms those of the partly systematic Luby transform code based on two other algorithms and has the lower bit error rate and overhead.
APA, Harvard, Vancouver, ISO, and other styles
2

K., L. Sudha, Gowda Ganesh, K.P Gagan, and Reddy P. Adarsh. "Implementation of Luby Transform Error Correcting Codes on FPGA." International Journal of Innovative Science and Research Technology (IJISRT) 8, no. 7 (2025): 3505–10. https://doi.org/10.5281/zenodo.15001456.

Full text
Abstract:
Luby Transform (LT) codes are rate less codes which are a type of fountain codes. They provide good performance over other fountain codes because, more efficient encoding and decoding algorithms can be devised for this code. These codes are rate less codes because they allow for flexible and adaptive rate allocation during the encoding process. With this, any desired code rate can be achieved by controlling the number of parity symbols generated during the encoding process. This paper explains the encoding and decoding aspects of LT codes in detail and generation and decoding is performed using MATLAB. Hardware implementation of LT code is attempted on FPGA by using Verilog code. As it is shown, the codes are very simple to implement and can be used as a more powerful error correcting codes.
APA, Harvard, Vancouver, ISO, and other styles
3

Nadhir, Ibrahim Abdulkhaleq, Abdul Jalil Salih Nahla, Salih Mohammed Hasan Rajaa, and Jabbar Hasan Ihsan. "A Simulink model for modified fountain codes." TELKOMNIKA (Telecommunication, Computing, Electronics and Control) 21, no. 1 (2023): 18–25. https://doi.org/10.12928/telkomnika.v21i1.23274.

Full text
Abstract:
This paper introduces a Simulink model design for a modified fountain code. The code is a new version of the traditional Luby transform (LT) codes. The design constructs the blocks required for generation of the generator matrix of a limited-degree-hopping-segment Luby transform (LDHS-LT) codes. This code is especially designed for short length data files which have assigned a great interest for wireless sensor networks. It generates the degrees in a predetermined sequence but random generation and partitioned the data file in segments. The data packets selection has been made serialy according to the integer generated from both degree and segment generators. The code is tested using Monte Carlo simulation approach with the conventional code generation using robust soliton distribution (RSD) for degree generation, and the simulation results approve better performance with all testing parameter.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Hongyu. "Raptor Codes with LT-LDPC Precoding Performance Analysis and FPGA Optimization." Highlights in Science, Engineering and Technology 97 (May 28, 2024): 55–64. http://dx.doi.org/10.54097/3x6yb210.

Full text
Abstract:
Raptor codes are designed to effectively handle packet loss and erasures as a type of fountain code, capable of generating an unlimited number of encoded symbols from source informations, which is particularly useful in scenarios where the number of transmissions is unknown or variable. Luby Transform (LT) codes, a kind of fountain code encoding method, exhibit linear complexity, and Low-Density Parity-Check (LDPC) codes can be constructed by the generator matrix and the parity-check matrix. The LT-LDPC pre-coding method combines the advantages of both, enhancing encoding and decoding efficiency. Deploying code on Field-Programmable Gate Arrays (FPGAs) involves several steps: synthesis, place and route, and bitstream generation, followed by loading the bitstream onto the FPGA to configure its internal logic according to the coding methods. This paper introduces a method of encoding and decoding Raptor codes, utilizing the intimal LT codes and the peripheral LDPC codes constructed by PEG. It employs a lop-BP decoding method over noise channels based on the Tanner graph for decoding and deploys the optimized algorithm on FPGA to enhance performance.
APA, Harvard, Vancouver, ISO, and other styles
5

Nadhir, Ibrahim Abdulkhaleq, Abbas Abed Faeza, Jabbar Hasan Ihsan, and Hasan Mahdi Falah. "Improving the data recovery for short length LT codes." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1972–79. https://doi.org/10.11591/ijece.v10i2.pp1972-1979.

Full text
Abstract:
Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.
APA, Harvard, Vancouver, ISO, and other styles
6

Abdulkhaleq, Nadhir Ibrahim, Faeza Abbas Abed, Ihsan Jabbar Hasan, and Falah Hasan Mahdi. "Improving the data recovery for short length LT codes." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1972. http://dx.doi.org/10.11591/ijece.v10i2.pp1972-1979.

Full text
Abstract:
Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.
APA, Harvard, Vancouver, ISO, and other styles
7

Al Wesabi, Mohammed Ahmed, Waled Al-Arashi, and Mohammed Al-Shadadi. "The Performance of Cooperative MIMO Scheme under Slow Fading Channel based on Fountain Code." Journal of Science and Technology 21, no. 2 (2016): 1–12. http://dx.doi.org/10.20428/jst.v21i2.1224.

Full text
Abstract:
Nowadays, the video calling, video on demand (VOD) and more services are desired for users. These services generate large traffic which requires special techniques for transmission without outages or failure during transmission operation. Fountain Code is the newest method in the encoding theory and it is handle designed to large data. Besides, modern MIMO channel gives higher capacity than traditional channel (SISO channel). This paper looks out of the performance of Fountain Code on MIMO Scheme under Slow Fading Channel. The results show the performance is the best on MIMO (DF). In addition, the performance increases by increasing in the number of receiver antennas.
 Keywords: Fountain Code, Luby Transform, Cooperative MIMO, Slow Fading, Bit Error Rate, Decode and Forward (DF).
APA, Harvard, Vancouver, ISO, and other styles
8

Hayajneh, Khaled F. "Memory-Based LT Codes for Efficient 5G Networks and Beyond." Electronics 10, no. 24 (2021): 3169. http://dx.doi.org/10.3390/electronics10243169.

Full text
Abstract:
The next-generation networks (5G and beyond) require robust channel codes to support their high specifications, such as low latency, low complexity, significant coding gain, and flexibility. In this paper, we propose using a fountain code as a promising solution to 5G and 6G networks, and then we propose using a modified version of the fountain codes (Luby transform codes) over a network topology (Y-network) that is relevant in the context of the 5G networks. In such a network, the user can be connected to two different cells at the same time. In addition, the paper presents the necessary techniques for analyzing the system and shows that the proposed scheme enhances the system performance in terms of decoding success probability, error probability, and code rate (or overhead). Furthermore, the analyses in this paper allow us to quantify the trade-off between overhead, on the one hand, and the decoding success probability and error probability, on the other hand. Finally, based on the analytical approach and numerical results, our simulation results demonstrate that the proposed scheme achieves better performance than the regular LT codes and the other schemes in the literature.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Si, Fanglin Niu, Lizheng Wang, and Ling Yu. "Shifted LT Code Security Scheme for Partial Information Encryption." Entropy 24, no. 12 (2022): 1776. http://dx.doi.org/10.3390/e24121776.

Full text
Abstract:
The existing physical layer security technology based on fountain codes needs to ensure that the legal channel is superior to the eavesdropping channel; when the quality of the legal channel and the eavesdropping channel are close, the information security cannot be guaranteed. Aiming at this problem, this paper proposes a shifted Luby transform (SLT) code security scheme for partial information encryption, which is mainly divided into two stages, partial information encryption transfer and degree distribution adjustment. The main idea is that the source randomly extracts part of the information symbols, and performs XOR encryption with the random sequence containing the main channel noise sent by the legitimate receiver. Afterward, the degree distribution is adjusted using the number of transfer information symbols received by the legitimate receiver to improve the average degree of the encoded codewords. Since the eavesdropper can only obtain fewer information symbols in the initial stage, it is difficult to decode the generated coded symbols after the degree distribution adjustment, thereby ensuring the safe transmission of information. The experimental results show that, compared with other LT anti-eavesdropping schemes, even if the legitimate channel is not dominant, the proposed scheme still has better security performance and less decoding overhead.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Lei, and Li Su. "Design of Improved BP Decoders and Corresponding LT Code Degree Distribution for AWGN Channels." Wireless Communications and Mobile Computing 2020 (October 20, 2020): 1–16. http://dx.doi.org/10.1155/2020/9517840.

Full text
Abstract:
This paper presents the performance of a hard decision belief propagation (HDBP) decoder used for Luby transform (LT) codes over additive white Gaussian noise channels; subsequently, three improved HDBP decoders are proposed. We first analyze the performance improvement of the sorted ripple and delayed decoding process in a HDBP decoder; subsequently, we propose ripple-sorted belief propagation (RSBP) as well as ripple-sorted and delayed belief propagation (RSDBP) decoders to improve the bit error rate (BER). Based on the analysis of the distribution of error encoded symbols, we propose a ripple-sorted and threshold-based belief propagation (RSTBP) decoder, which deletes low-reliability encoded symbols, to further improve the BER. Degree distribution significantly affects the performance of LT codes. Therefore, we propose a method for designing optimal degree distributions for the proposed decoders. Through simulation results, we demonstrate that the proposed RSBP and RSDBP decoders provide significantly better BER performances than the HDBP decoder. RSDBP and RSTDP combined with the proposed degree distributions outperformed state-of-the-art degree distributions in terms of the number of encoded symbols required to recover an input symbol correctly (NERRIC) and the frame error rate (FER). For a hybrid decoder formulated by combining RSDBP with a soft decision belief propagation decoder, the proposed degree distribution outperforms the other degree distributions in terms of decoding complexity.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Luby transform code"

1

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: <ol> <li>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).</li> <li> The successful decoding of systematic LT codes were verified.</li> <li>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).</li></ol> 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.<br>Dissertation (MEng)--University of Pretoria, 2008.<br>Electrical, Electronic and Computer Engineering<br>MEng<br>unrestricted
APA, Harvard, Vancouver, ISO, and other styles
2

Von, Solms Suné. "Design of effective decoding techniques in network coding networks / Suné von Solms." Thesis, North-West University, 2013. http://hdl.handle.net/10394/9544.

Full text
Abstract:
Random linear network coding is widely proposed as the solution for practical network coding applications due to the robustness to random packet loss, packet delays as well as network topology and capacity changes. In order to implement random linear network coding in practical scenarios where the encoding and decoding methods perform efficiently, the computational complex coding algorithms associated with random linear network coding must be overcome. This research contributes to the field of practical random linear network coding by presenting new, low complexity coding algorithms with low decoding delay. In this thesis we contribute to this research field by building on the current solutions available in the literature through the utilisation of familiar coding schemes combined with methods from other research areas, as well as developing innovative coding methods. We show that by transmitting source symbols in predetermined and constrained patterns from the source node, the causality of the random linear network coding network can be used to create structure at the receiver nodes. This structure enables us to introduce an innovative decoding scheme of low decoding delay. This decoding method also proves to be resilient to the effects of packet loss on the structure of the received packets. This decoding method shows a low decoding delay and resilience to packet erasures, that makes it an attractive option for use in multimedia multicasting. We show that fountain codes can be implemented in RLNC networks without changing the complete coding structure of RLNC networks. By implementing an adapted encoding algorithm at strategic intermediate nodes in the network, the receiver nodes can obtain encoded packets that approximate the degree distribution of encoded packets required for successful belief propagation decoding. Previous work done showed that the redundant packets generated by RLNC networks can be used for error detection at the receiver nodes. This error detection method can be implemented without implementing an outer code; thus, it does not require any additional network resources. We analyse this method and show that this method is only effective for single error detection, not correction. In this thesis the current body of knowledge and technology in practical random linear network coding is extended through the contribution of effective decoding techniques in practical network coding networks. We present both analytical and simulation results to show that the developed techniques can render low complexity coding algorithms with low decoding delay in RLNC networks.<br>Thesis (PhD (Computer Engineering))--North-West University, Potchefstroom Campus, 2013
APA, Harvard, Vancouver, ISO, and other styles
3

Štys, Jiří. "Implementace statistických kompresních metod." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-413295.

Full text
Abstract:
This thesis describes Burrow-Wheeler compression algorithm. It focuses on each part of Burrow-Wheeler algorithm, most of all on and entropic coders. In section are described methods like move to front, inverse frequences, interval coding, etc. Among the described entropy coders are Huffman, arithmetic and Rice-Golomg coders. In conclusion there is testing of described methods of global structure transformation and entropic coders. Best combinations are compared with the most common compress algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

"Designing Luby transform codes as an application layer." Thesis, 2011. http://hdl.handle.net/10210/3702.

Full text
Abstract:
M.Ing.<br>Application Layer Forward Error Correction (AL-FEC) is a relatively new concept which uses erasure codes to add reliability insurance to particular application streams on a network. This concept has become particularly popular for media streaming services. Fountain codes have shown promise as the erasure code of choice for these implementations. The Fountain code concept is a principle that has two popular instantiations, the Luby Transform (LT) code and the Raptor code. While the Raptor code is the more efficient of the two, the LT code is the focal point of our dissertation. Our main objective in this dissertation was broken up into two different primary objectives which we had to satisfy in its completion. The first of these primary objectives entailed the finding of sets of input parameters which would yield an optimal implementation of the LT code for a given set of input block sizes. The simulation work performed in this investigation was done on a wide range of input parameters for each input block size concerned. While there have been a number of other studies which have performed such parameter optimisation we have not found any that present such comprehensive results as we do. The second of the primary objectives related to the analysis of the code when applied as an AL-FEC reliability mechanism for streaming media. This simulation work was performed on simulated IP network environments using the NS2 network simulator. The codes which were applied to the network were based on the optimal parameter sets found in the first objective. We analysed the effective throughput achievable by the code in the face of various packet loss rates. With the data obtained from the simulations we then derived a constraint on the allowable bit-rate of media which uses the LT code as an AL-FEC reliability mechanism. In performing the work in this dissertation it was identified that it was required to develop the LT code related simulation tools for performing the respective investigations. This involved development of a stand-alone LT code simulator as well as an LT code AL-FEC reliability mechanism for NS2.
APA, Harvard, Vancouver, ISO, and other styles
5

Hornansky, Martin, and 何納己. "Multi-objective Performance Customization for Short-Length Luby Transform Erasure Correcting Codes using Evolution Strategies and Goal Programming." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/y96u3w.

Full text
Abstract:
博士<br>國立交通大學<br>電機資訊國際學程<br>105<br>Short-length Luby Transform (SLLT) codes, the first practical implementation of the digital fountain codes, are powerful randomized erasure protection codes that can be used to provide reliable data streaming services to multiple endpoints possessing different loss rates. However, due to the fact that different applications may impose on their decoding performance different sets of requirements, it is desirable to customize them with respect to these application-dependent requirements as well as with respect to the characteristics of protected source data. Moreover, since there is no feasible analytical method capable to deduce the decoding performance of these codes when their block length is short while greater than a few hundreds of symbols, the only feasible way to estimate their decoding performance is to execute a large number of Monte-Carlos based numerical simulations. In this thesis, we present a structured approach capable to customize the decoding performance of the LT codes so that the protected video bitstreams may have the best playback quality over a wide range of channel loss rates. Our thesis begins with the proposal of a new statistical decoding performance model based on three parameters: decoding overhead, symbol decoding failure rate and tail probability of symbol decoding failure rate. After demonstrating how to use the proposed performance model in order to specify any performance objective imposed on the decoding performance, we formulate the SLLT code customization as a multi-objective optimization problem and show a way how to convert it into a single-objective one using the Tchebyccheff goal programming approach. Consequently, we show how to choose a suitable optimization method capable to conduct the search for optimal solution and in the final part of this thesis we provide a set of rules how to adapt the chosen method in order to deliver robust and efficient convergence behavior. The capability and practicability of proposed approach to produce SLLT codes with the decoding performance tuned with respect to any set of performance objectives is demonstrated through two real-world SLLT code design scenarios, namely, through the design of: (1) SLLT post-code of a short-length raptor code that provides erasure protection to H.264 AVC bitstreams, and (2) SLLT post-code of a rateless UEP code that supports graceful degradation of H.264 SVC playback quality. Obtained empirical results confirm our expectations that chosen optimization method is able to efficiently converge to a set of very good solutions when searching for SLLT codes with decoding performance objectives set using proposed statistical performance model in terms of a goal program. Moreover, the results of our two real-world design scenarios demonstrate that proposed approach is capable of producing SLLT codes with customized decoding performance that enable the playback pictures to attain significantly higher PSNR values (at different stages of the decoding process) than the PSNR values of the pictures recovered under the protection of conventionally optimized codes.
APA, Harvard, Vancouver, ISO, and other styles
6

OROZCO, VIVIAN. "Trapping Sets in Fountain Codes over Noisy Channels." Thesis, 2009. http://hdl.handle.net/1974/5309.

Full text
Abstract:
Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia broadcast/multicast sessions and digital video broadcasting on global internet-protocol. The rateless property of Fountain codes holds great promise for noisy channels. These are more sophisticated mathematical models representing errors on communications links rather than only erasures. The practical implementation of Fountain codes for these channels, however, is hampered by high decoding cost and delay. In this work we study trapping sets in Fountain codes over noisy channels and their effect on the decoding process. While trapping sets have received much attention for low-density parity-check (LDPC) codes, to our knowledge they have never been fully explored for Fountain codes. Our study takes into account the different code structure and the dynamic nature of Fountain codes. We show that 'error-free' trapping sets exist for Fountain codes. When the decoder is caught in an error-free trapping set it actually has the correct message estimate, but is unable to detect this is the case. Thus, the decoding process continues, increasing the decoding cost and delay for naught. The decoding process for rateless codes consists of one or more decoding attempts. We show that trapping sets may reappear as part of other trapping sets on subsequent decoding attempts or be defeated by the reception of more symbols. Based on our observations we propose early termination methods that use trapping set detection to obtain improvements in realized rate, latency, and decoding cost for Fountain codes.<br>Thesis (Master, Electrical & Computer Engineering) -- Queen's University, 2009-10-29 14:33:06.548
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Luby transform code"

1

Weina, Dai, and Zhao Yuli. "A Novel Luby Transform Code with Improved Ripple Size." In Simulation Tools and Techniques. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72795-6_52.

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

"Luby Transform Codes." In Algebraic and Stochastic Coding Theory. CRC Press, 2017. http://dx.doi.org/10.1201/b11707-23.

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

Conference papers on the topic "Luby transform code"

1

Fang, Borui, Li Chen, and Weidong Wang. "Merged-r Luby Transform Coded Computation for Non-Linear Tasks in Wireless Networks." In 2024 16th International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2024. https://doi.org/10.1109/wcsp62071.2024.10827212.

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

da Silva Marques, Fabio, Marcelo da Silva Pinho, and Weiler Alves Finamorez. "CCSDS image compression recommendation with luby transform code for images from China-Brazil Earth Resources Satellite." In 2015 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC). IEEE, 2015. http://dx.doi.org/10.1109/imoc.2015.7369201.

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

Rui Cao and Liuqing Yang. "The Design of Decomposed Luby Transform Codes." In 2011 IEEE Global Communications Conference (GLOBECOM 2011). IEEE, 2011. http://dx.doi.org/10.1109/glocom.2011.6134475.

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

Nguyen, T. D., L. L. Yang, and L. Hanzo. "Systematic Luby Transform Codes and Their Soft Decoding." In 2007 IEEE Workshop on Signal Processing Systems. IEEE, 2007. http://dx.doi.org/10.1109/sips.2007.4387519.

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

Nguyen, T. D., M. El-Hajjar, L. L. Yang, and L. Hanzo. "A Systematic Luby Transform Coded V-BLAST System." In 2008 IEEE International Conference on Communications. IEEE, 2008. http://dx.doi.org/10.1109/icc.2008.152.

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

Grobler, T. L., E. R. Ackermann, J. C. Olivier, and A. J. van Zyl. "Systematic Luby Transform codes as incremental redundancy scheme." In AFRICON 2011. IEEE, 2011. http://dx.doi.org/10.1109/afrcon.2011.6072000.

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

Zhang, Wenbo, Chenxi Hao, and Guodong Xue. "An Approach of Reducing Overhead in Luby Transform Codes." In 2010 International Conference on Communications and Mobile Computing (CMC). IEEE, 2010. http://dx.doi.org/10.1109/cmc.2010.247.

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

AbdulHussein, Ali, Anand Oka, and Lutz Lampe. "Decoding with Early Termination for Rateless (Luby Transform) Codes." In 2008 IEEE Wireless Communications and Networking Conference. IEEE, 2008. http://dx.doi.org/10.1109/wcnc.2008.49.

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

Fang, Borui, Li Chen, Xiaohui Chen, and Weidong Wang. "Luby Transform Coded Computation with Error Detection in Wireless Networks." In 2023 IEEE 98th Vehicular Technology Conference (VTC2023-Fall). IEEE, 2023. http://dx.doi.org/10.1109/vtc2023-fall60731.2023.10333606.

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

Xu, Bin, Yin Xu, Dazhi He, Hao Ju, Na Gao, and Wenjun Zhang. "Efficient Multicast Schemes in Vehicle Network Based on Luby Transform Codes." In 2021 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB). IEEE, 2021. http://dx.doi.org/10.1109/bmsb53066.2021.9547079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Luby transform code' for particular source types:
Journal articles
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