Results 211 to 220 of about 26,841 (236)
Some of the next articles are maybe not open access.
On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes
2007 IEEE International Symposium on Information Theory, 2007In this paper we study the iterative decoding behavior of time-invariant and time-varying LDPC convolutional codes derived by unwrapping QC LDPC block codes. In particular, for a time-varying LDPC convolutional code, we show that the minimum pseudo-weight of the convolutional code is at least as large as the minimum pseudo-weight of the underlying QC ...
Ali Emre Pusane +3 more
openaire +1 more source
LDPC-based coded cooperative jamming codes
2012 IEEE Information Theory Workshop, 2012We present a practical coded cooperative jamming scheme for the problem of secure communications over the two-way wiretap channel. We design low-density parity-check (LDPC) based codes whose codewords interfere at the eavesdropper's terminal, thus providing secrecy.
Alexandre J. Pierrot, Matthieu R. Bloch
openaire +1 more source
7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph.
Zongjie Tu, Shiyong Zhang
openaire +1 more source
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph.
Zongjie Tu, Shiyong Zhang
openaire +1 more source
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.
D. Haley, A. Grant
openaire +2 more sources
2006 IEEE International Symposium on Information Theory, 2006
The design of generalized low-density parity-check (GLDPC) codes at both check and bit nodes over AWGN channel is considered in this paper. The new codes are referred to as doubly generalized LDPC codes. EXIT charts are used to optimize the parameters of these codes.
Yige Wang, Marc Fossorier
openaire +1 more source
The design of generalized low-density parity-check (GLDPC) codes at both check and bit nodes over AWGN channel is considered in this paper. The new codes are referred to as doubly generalized LDPC codes. EXIT charts are used to optimize the parameters of these codes.
Yige Wang, Marc Fossorier
openaire +1 more source
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 +1 more source
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 +1 more source
2001
An area of great interest for LDPC codes is the use of structured constructions rather than random constructions. These include graph theoretic approaches, such as the constructions by Margulis [Mar82] and Tanner [Tan00]. Ramanujan graphs are considered by Rosenthal and Vontobel [RV00] and finite geometries are used by Kou, Lin and Fos-sorier [KLF00 ...
openaire +1 more source
An area of great interest for LDPC codes is the use of structured constructions rather than random constructions. These include graph theoretic approaches, such as the constructions by Margulis [Mar82] and Tanner [Tan00]. Ramanujan graphs are considered by Rosenthal and Vontobel [RV00] and finite geometries are used by Kou, Lin and Fos-sorier [KLF00 ...
openaire +1 more source
A comparative study of BMST-LDPC codes and staircase-LDPC codes
Physical Communication, 2023Yinchu Wang, Xiao Ma
openaire +1 more source
2021
Low-density parity-check (LDPC) codes are a class of linear block codes that were first presented by Gallager in 1962. These codes have been the subject of much interest due to the fact that they can perform near Shannon limit. In this talk we study low-density parity-check (LDPC) codes having cubic semisymmetric graphs as their Tanner graphs.
Šimac, Marina +2 more
openaire +1 more source
Low-density parity-check (LDPC) codes are a class of linear block codes that were first presented by Gallager in 1962. These codes have been the subject of much interest due to the fact that they can perform near Shannon limit. In this talk we study low-density parity-check (LDPC) codes having cubic semisymmetric graphs as their Tanner graphs.
Šimac, Marina +2 more
openaire +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 +1 more source
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 +1 more source