Related papers: Symbolic Codes for Rotational Orbits
A construction is given of Markov partitions for some rational maps, which persist over regions of parameter space, not confined to single hyperbolic components. The set on which the Markov partition exists, and its boundary, are analysed.
Given a polynomial or a rational map f we associate to it a space of maps. We introduce local coordinates in this space, which are essentially the set of critical values of the map. Then we consider an arbitrary periodic orbit of f with…
This paper discusses phase space structures encountered in the neighborhood of periodic orbits with high order multiplicity in a 3D autonomous Hamiltonian system with a potential of galactic type. We consider 4D spaces of section and we use…
Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
The circular orbits and elliptical orbits of moving objects in a gravitational field are essential information in astronomy. There have been many methods developed in the literature and textbooks to describe these orbits. In this report, I…
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and…
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical…
The periodic standing wave approach to binary inspiral assumes rigid rotation of gravitational fields and hence helically symmetric solutions. To exploit the symmetry, numerical computations must solve for ``helical scalars,'' fields that…
We study bifurcations of non-orientable area-preserving maps with quadratic homoclinic tangencies. We study the case when the maps are given on non-orientable two-dimensional surfaces. We consider one and two parameter general unfoldings…
We present a topological proof of the existence of invariant manifolds for maps with normally hyperbolic-like properties. The proof is conducted in the phase space of the system. In our approach we do not require that the map is a…
We propose a general framework for computer-assisted verification of the presence of symmetry breaking, period-tupling and touch-and-go bifurcations of symmetric periodic orbits for reversible maps. The framework is then adopted to…
A general method for constructing convolutional codes from units in Laurent series over matrix rings is presented. Using group ring as matrix rings, this forms a basis for in-depth exploration of convolutional codes from group ring…
For typical cocycles over subshifts of finite type, we show that for any given orbit segment, we can construct a periodic orbit such that it shadows the given orbit segment and that the product of the cocycle along its orbit is a proximal…
We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data symbols using bitwise XOR and cyclic shift operations. The…
We define finite-time hyperbolic coordinates, describe their geometry, and prove various results on both their convergence as the time scale increases, and on their variation in the state space. Hyperbolic coordinates reframe the classical…
For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…
Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is…
We compute small rational models for configuration spaces of points on oriented surfaces, as right modules over the framed little disks operad. We do this by splitting these surfaces in unions of several handles. We first describe rational…