Augmented LT codes over binary extension fields with increased ratio of full‐degree columns
This letter proposes an augmented scheme of LT codes to improve the decoding success rate. The method involves substituting the 1‐s in full‐degree columns of the generator matrix of conventional LT codes with binary extension field elements and ...
Changyue Jiang +3 more
doaj +1 more source
Research on Stepwise UEP-LT Code for Ultraviolet Communication in Helicopter Emergency Landing Guiding [PDF]
Ultraviolet communication data determines the security of helicopter emergency landing.In order to provide greater protection for More Important Bits(MIB),a novel approach to provide Unequal Error Protection(UEP) based on the block duplication method and
ZHAO Taifei,LIU Xue,LIU Yijie
doaj +1 more source
AONT-LT: a Data Protection Scheme for Cloud and Cooperative Storage Systems
We propose a variant of the well-known AONT-RS scheme for dispersed storage systems. The novelty consists in replacing the Reed-Solomon code with rateless Luby transform codes.
Baldi, Marco +3 more
core +1 more source
Luby Transform Coding Aided Bit-Interleaved Coded Modulation for the Wireless Internet [PDF]
Bit-Interleaved Coded Modulation using Iterative Decoding (BICM-ID) is amalgamated with Luby Transform (LT) coding. The resultant joint design of the physical and data link layer substantially improves the attainable Bit Error Rate (BER) performance.
Hanzo, L +4 more
core +1 more source
Parallelisation technique for serial 3D seismic codes: SMS approach
<p style="margin: 0.0px 0.0px 0.0px 0.0px; font: 9.0px Times;">We investigate a fast and easy way to parallelise seismological serial codes mainly oriented for simulating the</p> <p style="margin: 0.0px 0.0px 0.0px 0.0px; font: 9.0px Times;
Vittorio Ruggiero +3 more
doaj +1 more source
Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel
In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set.
Chilappagari, Shashi Kiran +3 more
core +1 more source
Explicit construction of girth-eight QC-LDPC codes and its application in CRT method
For arbitrary code lengths of the form PL(P≥3L<sup>2</sup>/4+L-1),a new family of (4,L)-regular quasi-cyclic (QC) low-density parity-check (LDPC) codes was proposed explicitly with girth ight.Employing the new code as a component code in the ...
Guo-hua ZHANG, Rong SUN, Xin-mei WANG
doaj +2 more sources
Analysis of the Second Moment of the LT Decoder
We analyze the second moment of the ripple size during the LT decoding process and prove that the standard deviation of the ripple size for an LT-code with length $k$ is of the order of $\sqrt k.$ Together with a result by Karp et.
Maatouk, Ghid, Shokrollahi, Amin
core +1 more source
Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime
In this paper we analyze the bounds on the reliability of RaptorQ codes under maximum likelihood decoding, especially in the finite-length regime. RaptorQ code ensembles by a high-order low density generator-matrix (LDGM) code as pre-code and an inner ...
Ke Zhang, Qinyu Zhang, Jian Jiao
doaj +1 more source
Fountain Codes with Nonuniform Selection Distributions through Feedback
One key requirement for fountain (rateless) coding schemes is to achieve a high intermediate symbol recovery rate. Recent coding schemes have incorporated the use of a feedback channel to improve intermediate performance of traditional rateless codes ...
Cassuto, Yuval +2 more
core +1 more source

