Error-correcting codes and phase transitions
From MaRDI portal
Abstract: The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous curve in the space of parameters. The main goal of this paper is to relate the asymptotic bound to phase diagrams of quantum statistical mechanical systems. We first identify the code parameters with Hausdorff and von Neumann dimensions, by considering fractals consisting of infinite sequences of code words. We then construct operator algebras associated to individual codes. These are Toeplitz algebras with a time evolution for which the KMS state at critical temperature gives the Hausdorff measure on the corresponding fractal. We extend this construction to algebras associated to limit points of codes, with non-uniform multi-fractal measures, and to tensor products over varying parameters.
Recommendations
Cites work
- A new look at the crossed-product of a C *-algebra by an endomorphism
- Cuntz-Krieger algebras and wavelets on fractals
- DYNAMICAL DETAILED BALANCE AND LOCAL KMS CONDITION FOR NON-EQUILIBRIUM STATES
- Hecke algebras, type III factors and phase transitions with spontaneous symmetry breaking in number theory
- scientific article; zbMATH DE number 3836211 (Why is no real title available?)
- scientific article; zbMATH DE number 3842776 (Why is no real title available?)
- scientific article; zbMATH DE number 3930883 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- Information dynamics and open systems. Classical and quantum approach
- Iterated function systems, Ruelle operators, and invariant projective measures
- KMS states on C*-algebras associated to expansive maps
- Kolmogorov complexity and Hausdorff dimension
- Linear codes and modular curves
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Relations between varieties of kolmogorov complexities
- Simple \(C^*\)-algebras generated by isometries
- Simple Stably Projectionless C*-Algebras Arising as Crossed Products
- States of Toeplitz-Cuntz algebras
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Une classification des facteurs de type ${\rm III}$
Cited in
(14)- A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
- Differential subordination and convexity criteria of integral operators
- Codes as fractals and noncommutative spaces
- Multifractals, Mumford curves and eternal inflation
- Syntactic structures and code parameters
- Error-correcting codes and neural networks
- Kolmogorov complexity and the asymptotic bound for error-correcting codes
- Markov measures and extended zeta functions
- A computability challenge: asymptotic bounds for error-correcting codes
- Quantum-mechanical variant of the Thouless-Anderson-Palmer equation for error-correcting codes
- Statistical mechanics of low-density parity-check codes
- Statistical physics of irregular low-density parity-check codes
- Statistical Physics of Low Density Parity Check Error Correcting Codes
- Asymptotic bounds for spherical codes
This page was built for publication: Error-correcting codes and phase transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691642)
