scholarly journals Arithmetic Coding and Entropy for the Positive Geodesic Flow on the Modular Surface

2001 ◽  
Vol 1 (4) ◽  
pp. 569-582 ◽  
Author(s):  
B. Gurevich ◽  
S. Katok
2012 ◽  
Vol 20 (3) ◽  
pp. 37-50
Author(s):  
Dawoud Ahmadi Dastjerdi ◽  
Sanaz Lamei

Abstract Let G be the group generated by z ↦ z+2 and z → -1/z , z ∈ ℂ. This group acts on the upper half plane and the associated quotient surface is topologically a sphere with two cusps. Assigning a “geometric” code to an oriented geodesic not going to cusps, with alphabets in ℤ \ {0}, enables us to conjugate the geodesic ow on this surface to a special ow over the symbolic space of these geometric codes. We will show that for k ≥ 1, a subsystem with codes from ℤ \ {0; ±1; ±2;… ; ±k} is a TBS: topologically Bernouli scheme. For similar codes for geodesic ow on modular surface, this was true for k ≥ 3. We also give bounds for the entropy of these subsystems.


1984 ◽  
Vol 4 (4) ◽  
pp. 487-492 ◽  
Author(s):  
Roy L. Adler ◽  
Leopold Flatto

AbstractThe ‘backward continued fraction’ map studied by A. Reyni is defined by y = g(x) where g(x) equals the fractional part of 1/(1−x) for 0 < x < 1. We show that it is a factor map of a special cross-section map for the geodesic flow on the unit tangent bundle of the modular surface. This gives an alternative derivation of the fact that this map preserves the infinite measure dx/x on the unit interval.


Author(s):  
Jean-Michel Bismut

This book uses the hypoelliptic Laplacian to evaluate semisimple orbital integrals in a formalism that unifies index theory and the trace formula. The hypoelliptic Laplacian is a family of operators that is supposed to interpolate between the ordinary Laplacian and the geodesic flow. It is essentially the weighted sum of a harmonic oscillator along the fiber of the tangent bundle, and of the generator of the geodesic flow. In this book, semisimple orbital integrals associated with the heat kernel of the Casimir operator are shown to be invariant under a suitable hypoelliptic deformation, which is constructed using the Dirac operator of Kostant. Their explicit evaluation is obtained by localization on geodesics in the symmetric space, in a formula closely related to the Atiyah-Bott fixed point formulas. Orbital integrals associated with the wave kernel are also computed. Estimates on the hypoelliptic heat kernel play a key role in the proofs, and are obtained by combining analytic, geometric, and probabilistic techniques. Analytic techniques emphasize the wavelike aspects of the hypoelliptic heat kernel, while geometrical considerations are needed to obtain proper control of the hypoelliptic heat kernel, especially in the localization process near the geodesics. Probabilistic techniques are especially relevant, because underlying the hypoelliptic deformation is a deformation of dynamical systems on the symmetric space, which interpolates between Brownian motion and the geodesic flow. The Malliavin calculus is used at critical stages of the proof.


2017 ◽  
Vol 13 (10) ◽  
pp. 6552-6557
Author(s):  
E.Wiselin Kiruba ◽  
Ramar K.

Amalgamation of compression and security is indispensable in the field of multimedia applications. A novel approach to enhance security with compression is discussed in this  research paper. In secure arithmetic coder (SAC), security is provided by input and output permutation methods and compression is done by interval splitting arithmetic coding. Permutation in SAC is susceptible to attacks. Encryption issues associated with SAC is dealt in this research method. The aim of this proposed method is to encrypt the data first by Table Substitution Box (T-box) and then to compress by Interval Splitting Arithmetic Coder (ISAC). This method incorporates dynamic T-box in order to provide better security. T-box is a method, constituting elements based on the random output of Pseudo Random Generator (PRNG), which gets the input from Secure Hash Algorithm-256 (SHA-256) message digest. The current scheme is created, based on the key, which is known to the encoder and decoder. Further, T-boxes are created by using the previous message digest as a key.  Existing interval splitting arithmetic coding of SAC is applied for compression of text data. Interval splitting finds a relative position to split the intervals and this in turn brings out compression. The result divulges that permutation replaced by T-box method provides enhanced security than SAC. Data is not revealed when permutation is replaced by T-box method. Security exploration reveals that the data remains secure to cipher text attacks, known plain text attacks and chosen plain text attacks. This approach results in increased security to Interval ISAC. Additionally the compression ratio  is compared by transferring the outcome of T-box  to traditional  arithmetic coding. The comparison proved that there is a minor reduction in compression ratio in ISAC than arithmetic coding. However the security provided by ISAC overcomes the issues of compression ratio in  arithmetic coding. 


1993 ◽  
Author(s):  
Krystyna Ohnesorge ◽  
Peter Stucki ◽  
Hartwig Thomas

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 983
Author(s):  
Jingjian Li ◽  
Wei Wang ◽  
Hong Mo ◽  
Mengting Zhao ◽  
Jianhua Chen

A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian–Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols in the source sequence and the correlation between the corresponding symbols of the source and the side information sequences to improve the coding performance of the source. Since the encoder purges a part of symbols from the source sequence, a shorter codeword length can be obtained. Those purged symbols are still used as the context of the subsequent symbols to be encoded. An improved calculation method for the posterior probability is also proposed based on the purging feature, such that the decoder can utilize the correlation within the source sequence to improve the decoding performance. In addition, this scheme achieves better error performance at the decoder by adding a forbidden symbol in the encoding process. The simulation results show that the encoding complexity and the minimum code rate required for lossless decoding are lower than that of the traditional distributed arithmetic coding. When the internal correlation strength of the source is strong, compared with other DSC schemes, the proposed scheme exhibits a better decoding performance under the same code rate.


Sign in / Sign up

Export Citation Format

Share Document