Results 261 to 270 of about 49,874 (298)

Stopping Rules in Political Settings

2021
This chapter compares three rules of voice integration or ‘stopping rules’ (majority voting, unanimity, consensus) in terms of their democratic, epistemic and pragmatic value. It shows, first, how the consensus rule, whereby decisions are made without voting when nobody opposes openly, fares best at reconciling all three normative demands and, second ...
openaire   +1 more source

Predictability and stopping on lattices of sets

Probability Theory and Related Fields, 1993
As a first step in the development of a general theory of set-indexed martingales, we define predictability on a general space with respect to a filtration indexed by a lattice of sets. We prove a characterization of the predictable \(\sigma\)-algebra in terms of adapted and ``left- continuous'' processes without any form of topology for the index set.
Ivanoff, B. Gail, Merzbach, Ely, Schiopu-Kratina, Ioana   +2 more
openaire   +1 more source

Generalized LDPC codes and generalized stopping sets

IEEE Transactions on Communications, 2008
A 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

Stopping and Trapping Sets in Generalized Covering Arrays

2006 40th Annual Conference on Information Sciences and Systems, 2006
Certain 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, Emina Soljanin, Philip Whiting   +2 more
openaire   +1 more source

Stopping sets for MDS-based product codes

2016 IEEE International Symposium on Information Theory (ISIT), 2016
Stopping 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, Joseph Jean Boutros, Mireille Sarkiss   +2 more
openaire   +1 more source

A Notion of Stopping Line for Set-Indexed Processes

Journal of Theoretical Probability, 2006
zbMATH 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., 2003
The 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,, 2003
Recent 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, R. Urbanke, K. Viswanathan, J. Zhang   +3 more
openaire   +1 more source

A Statistical Method for Setting Stops in Stock Trading

Operations Research, 1970
This 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   +1 more source

Turbo stopping sets: the uniform interleaver and efficient enumeration

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
The performance of turbo decoding on the binary erasure channel (BEC) can be characterized in terms of turbo stopping sets. Apply turbo decoding until the transmitted codeword has been recovered, or until the decoder fails to progress further. Then the set of erased positions that will remain when the decoder stops is equal to the unique maximum size ...
Eirik Rosnes, Øyvind Ytrehus
openaire   +1 more source