Results 251 to 260 of about 446,195 (288)
Some of the next articles are maybe not open access.
Asymptotic distribution of absorbing sets and fully absorbing sets for regular sparse code ensembles
2011 Australian Communications Theory Workshop, 2011Past work focused on the asymptotic enumeration of trapping sets under random ensembles for specific codes. In this paper, we extend the asymptotic analysis of trapping sets to find the distribution of elementary absorbing sets and elementary fully absorbing sets, which are a special class of trapping sets. The asymptotic results for elementary (fully)
Chi-Wei Lin, Lara Dolecek
openaire +1 more source
Construction of Confidence Absorbing Sets Using Statistical Methods
Automation and Remote Control, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kibzun, A. I., Ivanov, S. V.
openaire +2 more sources
Absorbing set forn-person games
Zeitschrift f�r Operations Research, 1987This study tries to modify the von Neumann and Morgenstern (vN-M) solution. As with \textit{J. C. Harsanyi} [Manage. Sci., Theory 20, 1472--1495 (1974; Zbl 0335.90063)], vN-M solution is viewed in a dynamic sense. The final outcome of a game not only depends on the ability of players and standards of behavior of the particular society but also upon ...
openaire +2 more sources
Absorbing cantor sets and trapping structures
Ergodic Theory and Dynamical Systems, 1991AbstractIt it shown that a minimal attractor for a continuous, lebesgue non-singular transformation on an interval with no wandering intervals is either a periodic orbit, a finite collection of intervals, a simply attracting cantor set, or an absorbing cantor set.
openaire +1 more source
, 1991 This paper suggests a general framework to deal with learning, dynamics and evolution in games and economic environments. In this general set-up we define a (set-valued) solution concept and prove some properties, including existence. We then discuss more specific dynamical processes and show that the general solution concept provides quite intuitive ...
Itzhak Gilboa, Dov Samet
openaire +1 more source
NB-LDPC: Absorbing set and importance sampling
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012The identification of error sources when sub-optimal decoding algorithms are used is an open point both in binary and non-binary LDPC. Here a mathematical definition for absorbing sets in the case of non-binary LDPC is given and several examples are proposed to illustrate it.
A. Poloni, S. Valle, S. Vincenti
openaire +1 more source
Absorbing sets of codes from finite geometries
Cryptography and Communications, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Allison Beemer +2 more
openaire +2 more sources
Analysis of Absorbing Sets using Cosets and Syndromes
2020 IEEE International Symposium on Information Theory (ISIT), 2020Absorbing sets are combinatorial structures in a Tanner graph that have been shown to characterize iterative decoder failure, and particularly error floor behavior, of LDPC codes. In this paper, we examine the connection between absorbing sets and the syndromes of their support vectors.
Emily McMillon +2 more
openaire +1 more source
Absorbing sets of Fountain codes over noisy channels
2012 26th Biennial Symposium on Communications (QBSC), 2012Although error-prone patterns have been extensively studied for low-density parity-check (LDPC) codes, to the best of our knowledge, they have never been fully explored for Fountain codes. It is shown that dominant trapping sets of Fountain codes are the absorbing sets. They happen in the so-called error floor, corresponding to a significant flattening
Seyed Masoud Mirrezaei +2 more
openaire +1 more source
An absorbing set for cooperative games
Operations Research Letters, 1988This article investigates some properties of the absorbing set and proposes an example of a game that has no absorbing set.
openaire +2 more sources