Results 101 to 110 of about 5,133,673 (158)
, 2011 In the field of Error Correcting Coding (ECC), the concept of ''stopping set'' recently became a hot topic. A stopping set for a parity-check matrix is the set of bits which would cause the iterative decoding progress in Binary Erasure Channel (BEC) to ''
Zhijie, R. (author)
core
Perpetual Barrier Options in Jump-Diffusion Models [PDF]
We present a closed form solution to the perpetual American double barrier call option problem in a model driven by a Brownian motion and a compound Poisson process with exponential jumps.
Pavel V. Gapeev
core
Nonzero-sum Stochastic Games [PDF]
This paper treats of stochastic games. We focus on nonzero-sum games and provide a detailed survey of selected recent results. In Section 1, we consider stochastic Markov games. A correlation of strategies of the players, involving ``public signals'', is
Szajowski, Krzysztof, Nowak, Andrzej S.
core
Stopping of functionals with discontinuity at the boundary of an open set
We explore properties of the value function and existence of optimal stopping times for functionals with discontinuities related to the boundary of an open (possibly unbounded) set . The stopping horizon is either random, equal to the first exit from the
Palczewski, Jan, Stettner, Lukasz
core
On the Doléans function of set-indexed submartingales
A necessary and sufficient condition for the countable additivity of the Doléans function of a set-indexed weak submartingale is given in terms of stopping sets.Doob-Meyer decomposition Lattice Filtration Right-continuity Predictable [sigma]-algebra ...
De Giosa, Marcello, Mininni, Rosamaria
core
Low-Density Parity-Check Codes From Transversal Designs With Improved Stopping Set Distributions
, 2013 This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the level of Latin
Michael Huber, Alexander Gruner
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Stopping Sets of Hermitian Codes
IEEE Transactions on Information Theory, 2016Combinatorial structures called stopping sets are useful in analyzing the performance of a linear code when coupled with an iterative decoding algorithm over an erasure channel. In this paper, we consider stopping sets of Hermitian codes.
Sarah E. Anderson, Gretchen L. Matthews
openaire +2 more sources
Stopping set elimination for LDPC codes
2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2017This work studies the Stopping-Set Elimination Problem, namely, given a stopping set, how to remove the fewest erasures so that the remaining erasures can be decoded by belief propagation in k iterations (including k =∞). The NP-hardness of the problem is proven. An approximation algorithm is presented for k = 1.
Anxiao Andrew Jiang +6 more
openaire +2 more sources
Stopping set analysis for Hamming codes
IEEE Information Theory Workshop, 2005., 2005In 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 +2 more sources
Stopping sets for physical-layer security
2010 IEEE Information Theory Workshop, 2010Physical-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 +4 more
openaire +2 more sources