Results 271 to 280 of about 35,523 (280)
Some of the next articles are maybe not open access.
Improved reversible LDPC codes
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005We provide a thorough analysis for a class of iteratively encodable low-density parity-check codes. The iterative encoding technique is based upon the graphical representation of the code and allows the decoder circuit to also be used for encoding, thus saving circuit area.
David Victor Lawrie Haley, Alex Grant
openaire +3 more sources
2016 Information Theory and Applications Workshop (ITA), 2016
This paper presents a special type of LDPC codes with a structure related to but different from that of the spatially coupled LDPC codes. For an LDPC code of this type, its Tanner graph is composed of a set of small disjoint Tanner graphs which are connected together by a group of overall check-nodes, called global check-nodes.
Daniel J. Costello +4 more
openaire +2 more sources
This paper presents a special type of LDPC codes with a structure related to but different from that of the spatially coupled LDPC codes. For an LDPC code of this type, its Tanner graph is composed of a set of small disjoint Tanner graphs which are connected together by a group of overall check-nodes, called global check-nodes.
Daniel J. Costello +4 more
openaire +2 more sources
LDPC Code Designs, Constructions, and Unification
, 2017Written by leading experts, this self-contained text provides systematic coverage of LDPC codes and their construction techniques, unifying both algebraic- and graph-based approaches into a single theoretical framework (the superposition construction ...
Juane Li +4 more
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
From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality
2019In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this reliability is coding.
openaire +2 more sources
Stochastic Decoders for LDPC Codes
2014Binary and non-binary low density parity check (LDPC) codes are capacity-approaching codes that can be decoded with message-passing algorithms. These algorithms are inherently parallel, making LDPC codes attractive for simultaneously achieving a large coding gain and a high data throughput.
Vincent Gaudet +2 more
openaire +2 more sources
ePec-LDPC HARQ: An LDPC HARQ Scheme with Targeted Retransmission
IEICE Transactions on Communications, 2016Jiawei Liang +4 more
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
Construction of Check Matrix for B-LDPC and Non-binary LDPC Codes
2018In the high speed data transmission, Low-Density Parity-Check (LDPC) channel coding scheme is widely studied for its near Shannon limit and its good performance in the circumstance of low signal to noise ratio. The LDPC codes have several advantages over the Turbo codes and are one of the hottest topic in today’s coding theory research.
openaire +2 more sources