Results 271 to 279 of about 2,457,220 (279)
Some of the next articles are maybe not open access.
Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic LDPC Codes
IEEE Journal on Selected Areas in Communications, 2016The replicate-and-mask (R&M) construction of finite-length spatially-coupled (SC) LDPC codes is proposed in this paper. The proposed R&M construction generalizes the conventional matrix unwrapping construction and contains it as a special case.
Keke Liu, Mostafa El-Khamy, Jungwon Lee
semanticscholar +1 more source
2004
LDPC codes are one of the hottest topics in coding theory today. Originally invented in the early 1960’s, they have experienced an amazing comeback in the last few years. Unlike many other classes of codes, LDPC codes are already equipped with very fast (probabilistic) encoding and decoding algorithms.
openaire +2 more sources
LDPC codes are one of the hottest topics in coding theory today. Originally invented in the early 1960’s, they have experienced an amazing comeback in the last few years. Unlike many other classes of codes, LDPC codes are already equipped with very fast (probabilistic) encoding and decoding algorithms.
openaire +2 more sources
LDPC codes for the Slepian-Wolf coding
2012 National Conference on Communications (NCC), 2012LDPC codes are among the few FEC schemes that have been used for distributed data compression schemes, like the Slepian-Wolf encoding. An LDPC code having good degree distribution polynomials, along with a large girth and large minimum distance, can compress close to the Slepian-Wolf limit.
openaire +2 more sources
Euclidean Geometry-Based Spatially Coupled LDPC Codes for Storage
IEEE Journal on Selected Areas in Communications, 2016In this paper, we construct binary spatially coupled (SC) low-density parity-check (LDPC) codes based on Euclidean geometry (EG) LDPC codes for storage applications, where high error correction capability, extremely low uncorrectable bit error rate (UBER)
Yixuan Xie +3 more
semanticscholar +1 more source
Improved PEG construction of large girth QC-LDPC codes
International Symposium on Turbo Codes and Iterative Information Processing, 2016In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-
M. Diouf +4 more
semanticscholar +1 more source
Design of structured irregular LDPC codes from structured regular LDPC codes
Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT), 2015Irregular Low-Density Parity-Check (LDPC) codes exhibit a performance extremely close to the Shannon capacity formula. In this paper, we presented a method of developing structured irregular LDPC codes from structured regular LDPC codes. The design is based on the expansion of the column-weight two LDPC codes.
K. Jaya Sankar, Vibha Kulkarni
openaire +2 more sources
2014
The best results on LDPC convolutional codes are summarized. Such results have been obtained, up to now, after proper transformations of good LDPC block codes. Unwrapping assures better performance with respect to that of the original parent block code. Irregular codes appear to be preferable.
openaire +2 more sources
The best results on LDPC convolutional codes are summarized. Such results have been obtained, up to now, after proper transformations of good LDPC block codes. Unwrapping assures better performance with respect to that of the original parent block code. Irregular codes appear to be preferable.
openaire +2 more sources
Quantum Information Processing, Quantum Computing, and Quantum Error Correction, 2021
I. Djordjevic
semanticscholar +1 more source
I. Djordjevic
semanticscholar +1 more source