Related papers: Strange Attractor in Density Evolution
Progress in designing channel codes has been driven by human ingenuity and, fittingly, has been sporadic. Polar codes, developed on the foundation of Arikan's polarization kernel, represent the latest breakthrough in coding theory and have…
Different mechanisms for the creation of strange non-chaotic dynamics in the quasiperiodically forced logistic map are studied. These routes to strange nonchaos are characterised through the behavior of the largest nontrivial Lyapunov…
We consider dynamical behavior of non-autonomous wave-type evolutionary equations with nonlinear damping, critical nonlinearity, and time-dependent external forcing which is translation bounded but not translation compact (i.e., external…
Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel…
We describe a new notation for finite transformations. This attractor-cycle notation extends the orbit-cycle notation for permutations and builds upon existing transformation notations. How the basins of attraction of a finite…
Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is…
The analysis of the long-term behavior of the mathematical model of a neural network constitutes a suitable framework to develop new tools for the dynamical description of nonautonomous state-dependent delay equations (SDDEs). The concept…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
There exists a variety of physically interesting situations described by continuous maps that are nondifferentiable on some surface in phase space. Such systems exhibit novel types of bifurcations in which multiple coexisting attractors can…
A chaotic attractor is usually characterised by its multifractal spectrum which gives a geometric measure of its complexity. Here we present a characterisation using a minimal set of independant parameters which are uniquely determined by…
We consider unstable attractors; Milnor attractors $A$ such that, for some neighbourhood $U$ of $A$, almost all initial conditions leave $U$. Previous research strongly suggests that unstable attractors exist and even occur robustly (i.e.…
We study theoretically a binary system in which an attraction of unlike particles is combined with a type-independent soft core repulsion. The possible experimental implementation of the system is a mixture of DNA-covered colloids, in which…
This paper presents a puncturing technique to design length-compatible polar codes. The punctured bits are identified with the help of differential evolution (DE). A DE-based optimization framework is developed where the sum of the…
We improve the method in \cite{Seidl:10} for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes. Decoding of the scheme integrates easily in the known…
We show that it is possible to devise a large class of skew--product dynamical systems which have strange nonchaotic attractors (SNAs): the dynamics is asymptotically on fractal attractors and the largest Lyapunov exponent is nonpositive.…
Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\i}kan's polar encoder and…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…
We investigate the response of quasiperiodically driven nonlinear systems exhibiting strange non- chaotic attractors (SNAs) to deterministic input signals. We show that if one uses two square waves in aperiodic manner as input to a…
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
Polar coding was conceived originally as a technique for boosting the cutoff rate of sequential decoding, along the lines of earlier schemes of Pinsker and Massey. The key idea in boosting the cutoff rate is to take a vector channel (either…