Results 241 to 250 of about 651,900 (282)

The CrescNet Registry Achondroplasia Module: Real-World Demographic Data and Clinical Outcomes in Untreated and Vosoritide-Treated Individuals.

Horm Res Paediatr
Mohnike K, Beger C, Gausche R, Hoyer-Kuhn H, Muschol N, Palm K, Rohrer TR, Sredkova M, Streata I, Wechsung K, Woelfle J, Zeman J, Eibenstein U, Pimenta JM, Reichert A, Pfäffle R.   +15 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory, 2005
Summary: We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner, called progressive edge-growth (PEG) algorithm. Lower bounds on the girth of PEG Tanner graphs and on the minimum distance of the resulting low-density parity-check (LDPC)
D M Arnold, Xiao-Yu Hu, E Eleftheriou
exaly   +3 more sources

Bounds on the Expansion Properties of Tanner Graphs

IEEE Transactions on Information Theory, 2007
This work focuses on the expansion properties of a Tanner Graph because they are known to be related to the performance of associated iterative message-passing algorithms over various channels. By analyzing the eigenvalues and corresponding eigenvectors of the normalized incidence matrix representing a Tanner Graph, lower bounds on these expansion ...
Keith M Chugg
exaly   +2 more sources

Probabilistic analysis of cycles in random Tanner graphs

2013 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2013), 2013
Cycles in bipartite graphs (also called Tanner graphs in channel coding field) are of particular interest in modern coding theory, especially in capacity-achieving low-density parity-check (LDPC) codes. In this paper, the expected number of cycles of various lengths in randomly constructed regular and irregular Tanner graphs are calculated. For a given
Xiaopeng Jiao, Jianjun Mu
exaly   +2 more sources

On the Complexity of finding stopping set size in Tanner Graphs

2006 40th Annual Conference on Information Sciences and Systems, 2006
The problem of determining whether a tanner graph for a linear block code has a stopping set of a given size is shown to be NP-complete.
Priti Shankar
exaly   +2 more sources

Exhaustive Enumeration of Elementary Trapping Sets of an Arbitrary Tanner Graph

IEEE Communications Letters, 2016
An effective branch-and-bound (B&B) algorithm for exhaustively enumerating the elementary trapping sets (ETSs) in an arbitrary given Tanner graph is described. Given a Tanner graph $G$ and a positive integer $\nu $ , we introduce a novel 0–1 integer linear programming (ILP) formulation of the $\mathcal{NP}$ -hard problem of finding the ...
Hossein Falsafain
exaly   +3 more sources

Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs

IEEE Communications Letters, 2007
This correspondence presents an approach to the representation of cycles of Tanner graphs on associated parity-check matrices. Several equivalent conditions for the girth of a Tanner graph to be 2k are proposed. An algorithm to determine girth of associated Tanner graphs of parity-check matrices is proposed, also with an algorithm to count shortest ...
Huawei Huang, Guozhen Xiao
exaly   +2 more sources

Calculation of Mutual Information between Messages in Loops of a Tanner Graph

2006 IEEE International Symposium on Information Theory, 2006
This paper introduces a method for calculating the mutual information between the messages sent to a loop and and returning from a loop in a Tanner graph. This mutual information is defined as the difference between the cases when the loop is open and the loop is closed.
Kalle Ruttik
exaly   +3 more sources

Codes that have tanner graphs with non-overlapping cycles

2008 5th International Symposium on Turbo Codes and Related Topics, 2008
The sum-product algorithm (SPA) for the decoding of low density parity check (LDPC) codes produces exact posterior probabilities when the underlying Tanner graph is cycle-free. However, it has been shown that cycle-free Tanner graphs cannot support good codes as they have poor minimum distance properties.
Andrew Thangaraj
exaly   +2 more sources

Tanner Graph Based Image Interpolation

2010 Data Compression Conference, 2010
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variable node and the local image structure around each pixel as a check node.
Ruiqin Xiong, Wen Gao 0001
openaire   +1 more source