Results 21 to 30 of about 10,758 (305)
About zero bitwatermarking error exponents [PDF]
2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017 This paper aims to motivate more research works on the design of zero-bit watermarking schemes by showing an upper bound of the performances that known solutions failed to reach. To this end, an upper bound of error exponent characteristic is derived by translating Costa's rationale to zero-bit watermarking with side information. Three schemes are then
openaire +2 more sources
Jacobi i jego polemika z idealizmem transcendentalnym
Ethics in Progress, 2013 The subject of this article is the practical philosophy of Friedrich H. Jacobi (1743-1819), which the author tries to reconstruct on the basis of the work entitled “Jacobi an Fichte” (1799). Jacobi distinguishes between two kinds of truth: “Wahrheit” and
Igor Nowikow
doaj +3 more sources
Benchmarking the Ising universality class in $3 \le d < 4$ dimensions
SciPost Physics, 2023 The Ising critical exponents $\eta$, $\nu$ and $\omega$ are determined up to one-per-thousand relative error in the whole range of dimensions $3 \le d < 4$, using numerical conformal-bootstrap techniques. A detailed comparison is made with results by the
Claudio Bonanno, Andrea Cappelli, Mikhail Kompaniets, Satoshi Okuda, Kay Joerg Wiese
doaj +1 more source
Error Exponents of Typical Random Codes [PDF]
2018 IEEE International Symposium on Information Theory (ISIT), 2018 26 pages, submitted for ...
openaire +2 more sources
On the Universality of Burnashev's Error Exponent [PDF]
IEEE Transactions on Information Theory, 2005 We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific family of discrete memoryless channels. Recent results (A. Tchamkerten and I.E. Telatar) show that for
A. Tchamkerten, I.E. Telatar
openaire +2 more sources
Serially Concatenated Polar Codes
IEEE Access, 2018 Simulation results show that the performance of polar codes is improved vastly by using polar codes as inner codes in serially concatenated coding schemes.
Erdal Arikan
doaj +1 more source
Error Exponent for Multiple-Access Channels: Lower Bounds [PDF]
IEEE Transactions on Information Theory, 2014 A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a two-user discrete memoryless (DM) multiple-access channel (MAC), three lower bounds on the reliability function are
Nazari, Ali +2 more
openaire +2 more sources
Statistical mechanics of error exponents for error-correcting codes
Physical Review E, 2006 Error exponents characterize the exponential decay, when increasing message length, of the probability of error of many error-correcting codes. To tackle the long standing problem of computing them exactly, we introduce a general, thermodynamic, formalism that we illustrate with maximum-likelihood decoding of low-density parity-check (LDPC) codes on ...
Mora, Thierry, Rivoire, Olivier
openaire +4 more sources
Method of recurrent analysis for the generalized synchronization regime detection in different classes of dynamical systems [PDF]
Известия Саратовского университета. Новая серия: ФизикаBackground and Objectives: In this paper we study the possibility of quantitative determination of the boundary of the generalized synchronization regime in unidirectionally and mutually coupled systems with different attractor topologies by means of the
Illarionova, Ekaterina Dmitrievna +1 more
doaj +1 more source
On the Kalman Filter error covariance collapse into the unstable subspace [PDF]
Nonlinear Processes in Geophysics, 2011 When the Extended Kalman Filter is applied to a chaotic system, the rank of the error covariance matrices, after a sufficiently large number of iterations, reduces to <i>N</i><sup>+</sup> + N<sup>0</sup> where <i&
A. Trevisan, L. Palatella
doaj +1 more source