— The problem of finding the stopping distance of the Tanner graph for a linear block code is shown to be NP-Hard.

This paper describes the calculation of the optimal partition parameters such that the girth maximum (m, r) Balanced Tanner Unit lies in family of BTUs specified by them using a series of proved results and thus creates a framework for specifying a search problem for finding the girth maximum (m, r) BTU. Several open questions for girth maximum (m, r) BTU have been raised.

The Borel-Tanner probability distribution was derived by Borel (1942) and Tanner (1953) to characterize the distribution behavior of the number of customers served in a queuing system with Poisson input and constant service time. Later this probability distribution was applied in some models for random trees and branching processes. In the latter case one of the parameters can be interpreted as...

The Tanner graph associated with an extended parity-check (EPC) matrix of a cyclic code is shown to be useful in effectively implementing soft decision iterativedecoding procedures based on belief propagation. Decoding with an EPC matrix has the advantage that is universal, in the sense that it does not depend on the specific family of cyclic codes being used. It is shown that there is no need ...

This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance compar...

Ronald N. Cortright, Heidi L. Lujan, Julie H. Cox, Maria A. Cortright, Brandon M. Langworthy, Lorene M. Petta, Charles J. Tanner, and Stephen E. DiCarlo Departments of Kinesiology and Physiology, East Carolina University, Greenville, North Carolina; Department of Physiology, Wayne State University School of Medicine, Detroit, Michigan; Department of Kinesiology, East Carolina University, Greenv...

The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...

We present a CAD system for skeletal age assessment based on Tanner-Whitehouse method. Using digital X-ray left hand images, maturity indicators are searched by means of a interactive process. Results indicate that this approach is useful to speed up the analysis of growth disorders.