Results 141 to 150 of about 202,859 (188)

Doped Accumulate LT Codes

2007 IEEE International Symposium on Information Theory, 2007
We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, that are capacity-approaching on a binary erasure channel (BEC) with bounded encoding and decoding complexity. DALT codes can be either systematic or non-systematic. Non-systematic DALT codes are very similar to raptor codes, except that joint optimization on the full
Xiaojun Yuan, null Li Ping
openaire   +1 more source

Parallel processing with <code>promises</code>

Communications of the ACM, 2015
A simple method of writing a collaborative system.
openaire   +1 more source

Fingerprint Authentication Using LT Codes

Proceedings of the 2018 2nd International Conference on Biometric Engineering and Applications, 2018
Biometric is used for identifying the person based on their traits. Fingerprint is one of the most important and most used biometric trait for person authentication. Fingerprint database must be stored in efficient way and in most secure way so that it is unable to hack by the hacker and it will be able to recognize the person fast in large database ...
Parth Pahariya, Sanjay Kumar Singh
openaire   +1 more source

Quasi-systematic doped LT codes

IEEE Journal on Selected Areas in Communications, 2009
We propose a family of binary erasure codes, namely, quasi-systematic doped LT (QS-DLT) codes that are almost systematic, universal, and asymptotically capacity-achieving with encoding and decoding complexity O(Klog(1/e)), where K is the information length, and e is the overhead.
Xiaojun Yuan, Li Ping
openaire   +1 more source

Service-Driven Approximate LT Codes

2010 IEEE International Conference on Communications, 2010
Luby Transform (LT) codes are becoming increasingly important in transmission due to the ability to protect the source data in high reliability economically. LT codes generate rateless packets on-the-fly through randomly chosen encoding degree, so it cannot control or manage the service quality according to distinct service demands of clients.
K.-C. Yang, C.-L. Lin, T.-L. Wu, J.-S. Wang   +3 more
openaire   +1 more source

LT coding over the network

2010 International Conference on Wireless Communications & Signal Processing (WCSP), 2010
LT codes promise reliable transmissions of data between peers and have been proven as a method especially suitable for multimedia multicast and broadcast applications. In this paper we study a model in which broadcast is carried out over a wireless multi-hop network by taking advantage of the reliability of LT codes.
Sida Lv, Zhifeng Zhao, Honggang Zhang
openaire   +1 more source

Decoding Improvement for LT Codes

Applied Mechanics and Materials, 2013
In this paper the performance of LT codes is analyzed. And then, for the remaining part of information which can be decoded still exists when decoding failure, an improved message passing decoding algorithm which retains the original algorithm framework is proposed.
Li Na Wang, Wei Tang
openaire   +1 more source

LT Codes with Limited Feedback

2014 IEEE International Conference on Computer and Information Technology, 2014
Rate less codes, such as LT codes, are a class of widely used practical forward error correcting codes. However, conventional LT codes do not make use of feedback information. In addition, owing to the selection of the symbols randomly, conventional LT codes have large redundancy. In this paper, LT codes with limited feedback are investigated.
Jia Dai, Fei Zesong, Shangguan Chenglin, Cao Congzhe, Kuang Jingming   +4 more
openaire   +1 more source

Rateless codes from spatially coupled regular-LT codes

2015 Iran Workshop on Communication and Information Theory (IWCIT), 2015
In this paper, we study the performance of spatially coupled LT (SC-LT) codes under low-complexity belief-propagation (BP) decoding when the transmission is over a binary erasure channel (BEC). We derive a tight upper bound and lower bound on the asymptotic error probability of these rateless codes in terms of overhead and the check degree in the limit
openaire   +1 more source

Erasure Floor Analysis of Distributed LT Codes

IEEE Transactions on Communications, 2015
We investigate the erasure floor performance of distributed Luby transform (DLT) codes for transmission within a multi-source, single-relay, and single-destination erasure-link network. In general, Luby transform (LT) codes exhibit a high erasure floor due to poor minimum-distance properties, which can be improved by maximizing the minimum variable ...
Iqbal Hussain, Ming Xiao, Lars Kildehoj Rasmussen   +2 more
openaire   +2 more sources