Results 221 to 230 of about 48,940 (255)
Some of the next articles are maybe not open access.
Stopping and Trapping Sets in Generalized Covering Arrays
2006 40th Annual Conference on Information Sciences and Systems, 2006Certain combinatorial structures embedded in the parity-check matrix of linear codes, such as stopping and trapping sets, are known to govern the behavior of the codes' bit error rate curves under iterative decoding. We show how the Lovasz local lemma can be used to obtain epsiv-probability bounds on the frequency of occurrence of such structures.
Olgica Milenkovic +2 more
openaire +1 more source
Generalized LDPC codes and generalized stopping sets
IEEE Transactions on Communications, 2008A generalized low-density parity check code (GLDPC) is a low-density parity check code in which the constraint nodes of the code graph are block codes, rather than single parity checks. In this paper, we study GLDPC codes which have BCH or Reed-Solomon codes as subcodes under bounded distance decoding (BDD).
Nenad Miladinovic, Marc P. C. Fossorier
openaire +1 more source
On the complexity of and solutions to the minimum stopping and trapping set problems
Theoretical Computer Science, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alvaro Velasquez +2 more
openaire +1 more source
Stopping sets for MDS-based product codes
2016 IEEE International Symposium on Information Theory (ISIT), 2016Stopping sets for MDS-based product codes under iterative row-column algebraic decoding are analyzed in this paper. A union bound to the performance of iterative decoding is established for the independent symbol erasure channel. This bound is tight at low and very low error rates.
Fanny Jardel +2 more
openaire +1 more source
A Notion of Stopping Line for Set-Indexed Processes
Journal of Theoretical Probability, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saada, Diane, Slonowsky, Dean
openaire +2 more sources
Stopping sets in codes from designs
IEEE International Symposium on Information Theory, 2003. Proceedings., 2003The size of the smallest stopping set in LDPC codes helps in analyzing their performance under iterative decoding, just a minimum distance helps in analyzing the performance under maximum likelihood decoding. We study stopping sets in LDPC codes arising from 2-designs, in particular LDPC codes derived from projective and Euclidean geometries. We derive
N. Kashyap, A. Vardy
openaire +1 more source
Stopping sets and the girth of Tanner graphs
Proceedings IEEE International Symposium on Information Theory,, 2003Recent work has related the error probability of iterative decoding over erasure channels to the presence of stopping sets in the Tanner graph of the code used. In particular, it was shown that the smallest number of uncorrected erasures is the size of the graph's smallest stopping set. Relating stopping sets and girths, we consider the size /spl sigma/
A. Orlitsky +3 more
openaire +1 more source
A Statistical Method for Setting Stops in Stock Trading
Operations Research, 1970This paper applies the exponential distribution to stock price reactions to determine, at three confidence levels, the critical percentage price reaction beyond which a reaction constitutes a strong likelihood of a major reversal or halt in the stock's present general price trend. We show that these critical values can be used to determine stop losses,
openaire +2 more sources
Stopping sets: Gamma-type results and hitting properties
Advances in Applied Probability, 1999Recently in the paper by Møller and Zuyev (1996), the following Gamma-type result was established. Given n points of a homogeneous Poisson process defining a random figure, its volume is Γ( n ,λ) distributed, where λ is the intensity of the process.
openaire +2 more sources