Results 201 to 210 of about 3,456 (247)

Longitudinal management and novel pharmacological interactions in a patient with HeFH, 21-OHD, and kawasaki disease: a 6-year clinical follow-up. [PDF]

Front Endocrinol (Lausanne)
Zhang Y, Yuan X, Yang X, Chen R.
europepmc   +1 more source

Green synthesis of silver nanoparticles by <i>Kocuria flava</i> isolated from photovoltaic panels for combating infections, cancer, and water pollution. [PDF]

Front Microbiol
Prajapati V, Panchal D, Dikshit M, Patel R, Bhavsar S, Patel A, Sahoo DK, Luhana K.   +7 more
europepmc   +1 more source

Advances in Quantum Computation in NISQ Era. [PDF]

Entropy (Basel)
Xie XD, Zhang X, Koczor B, Yuan X.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Codes with girth 8 Tanner graph representation

Designs, Codes, and Cryptography, 2009
\textit{T. Halford} et al [IEEE Trans. Inform. Theory 52, No. 9, 4219--4223 (2006)] gave a necessary condition for a code to be represented by a 4-cycle-free Tanner graph. Here the authors extend this condition for 4 and 6 cycle-free Tanner graphs. They found a new necessary condition for codes having Tanner graph representation with girth 8.
Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario   +2 more
exaly   +3 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   +2 more sources

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)
E Eleftheriou
exaly   +2 more sources

A practical algorithm for tanner graph based image interpolation

2010 IEEE International Conference on Image Processing, 2010
This paper interprets image interpolation as a decoding problem on tanner graph and proposes a practical belief propagation algorithm based on a gaussian autoregressive image model. This algorithm regards belief propagation as a way to generate and fuse predictions from various check nodes. A low complexity implementation of this algorithm measures and
Ruiqin Xiong, Wenpeng Ding, Siwei Ma
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   +2 more sources