Results 261 to 270 of about 127,164 (309)

Stopping sets for physical-layer security

2010 IEEE Information Theory Workshop, 2010
Physical-layer security based on wiretap codes can be used to complement cryptographic applications at higher layers of the protocol stack. We assume a passive eavesdropper that has access to noise-corrupted codewords with erasures that are statistically independent to those of the legitimate communication partners.
Willie K. Harrison, João Almeida 0004, Demijan Klinc, Steven W. McLaughlin, João Barros   +4 more
openaire   +1 more source

Stopping set analysis for Hamming codes

IEEE Information Theory Workshop, 2005., 2005
In the 2004 Shannon Lecture, McEliece presented an expression for the number of stopping sets of size three in a Hamming code. In this paper, we investigate how this number depends on the parity-check matrix used in the decoding process. First, we present basic results on stopping set enumerators for block codes in general.
Jos H. Weber, Khaled A. S. Abdel-Ghaffar
openaire   +1 more source

Stopping Set Distribution of LDPC Code Ensembles

IEEE Transactions on Information Theory, 2003
Stopping sets determine the performance of low-density parity-check (LDPC) codes under iterative decoding over erasure channels. We derive several results on the asymptotic behavior of stopping sets in Tanner-graph ensembles, including the following. An expression for the normalized average stopping set distribution, yielding, in particular, a critical
Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang   +2 more
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 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

Small stopping sets in Steiner triple systems

Cryptography and Communications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles J. Colbourn, Yuichiro Fujiwara
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