A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes

DOI10.1007/978-3-642-27654-5_13zbMath1353.03079arXiv1107.4246OpenAlexW245025004MaRDI QIDQ2891310

Yuri I. Manin

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.4246

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Constructive and recursive analysis (03F60) Bounds on codes (94B65) Computation over the reals, computable analysis (03D78)

Related Items (5)

Syntactic structures and code parameters ⋮ Error-correcting codes and neural networks ⋮ Differential subordination and convexity criteria of integral operators ⋮ Codes as fractals and noncommutative spaces ⋮ Asymptotic bounds for spherical codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error-correcting codes and phase transitions
• Holomorphic supergeometry and Yang-Mills superfields
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.
• Renormalization and computation I: motivation and background
• Renormalisation and computation II: time cut-off and the Halting Problem
• Plottable Real Number Functions and the Computable Graph Theorem
• Random codes: minimum distances and error exponents
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes