Related papers: Strange Attractor in Density Evolution

We consider invertible linear maps with additive spherical bounded noise. We show that minimal attractors of such random dynamical systems are unique, strictly convex and have a continuously differentiable boundary. Moreover, we present an…

In this article, we investigate the long-term dynamics of a class of two- and three-dimensional non-Newtonian fluids of differential type, known as third-grade fluids. We first show that when the external forcing is sufficiently small, the…

We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…

In this paper we present a comprehensive mechanism for the emergence of strange attractors in a two-parametric family of differential equations acting on a three-dimensional sphere. When both parameters are zero, its flow exhibits an…

Boolean networks at the critical point have been a matter of debate for many years as, e.g., scaling of number of attractor with system size. Recently it was found that this number scales superpolynomially with system size, contrary to a…

We analyze the pairing instabilities for fermions on hexagonal lattices (both honeycomb and triangular ones) in a wide range of fermionic densities. We argue that for a generic doping in this range, superconductivity at weak coupling is of…

Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means…

In this paper, we introduce two novel methods to design outer polar codes for two previously proposed concatenated polar code architectures: augmented polar codes and local-global polar codes. These methods include a stopping set (SS)…

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibility in the choice of design parameters like rate, average…

This survey is a presentation of the arguments in the proof that Henon-like maps f_a(x,y)=(1-a x^2,0) + R(a,x,y) with |R(a,x,y)|< b have a "strange attractor", with positive Lebesgue probability in the parameter "a", if the perturbation…

Based on both qualitative method and numerical tests for a series of particular cases in the parameter region, a=1, 0<b <1, it is shown that the three-dimensional system (2) may have a series of interesting phenomena on the non-trivial…

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…

Polar codes introduced by Arikan in 2009 are the first code family achieving the capacity of binary-input discrete memoryless channels (BIDMCs) with low-complexity encoding and decoding. Identifying unreliable synthetic channels in polar…

Codes based on SUDOKU puzzles are discussed, and belief propagation decoding introduced for the erasure channel. Despite the non-linearity of the code constraints, it is argued that density evolution can be used to analyse code performance…

A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…

This paper focuses on an improved Gaussian approximation (GA) based construction of polar codes with successive cancellation (SC) decoding over an additive white Gaussian noise (AWGN) channel. Arikan has proven that polar codes with…

Performance of reliable communication over a coherent slow fading channel at high SNR is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. We study the problem of designing codes that optimally tradeoff…

When a neural network (NN) is used to decode a polar code, its training complexity scales exponentially as the code block size (or to be precise, as a number of message bits) increases. Therefore, existing solutions that use a neural…

We consider the problem of coding for the substring channel, in which information strings are observed only through their (multisets of) substrings. Due to existing DNA sequencing techniques and applications in DNA-based storage systems,…

The long-haul communication systems can offer ultra high-speed data transfer rates but suffer from burst errors. The high-rate and high-performance staircase codes provide an efficient way for long-haul transmission. The staircase coding…