Asymptotic bounds for spherical codes

by   Yuri I. Manin, et al.

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The central problem of the theory of such codes consists in maximizing simultaneously the transmission rate of the code and the relative minimum Hamming distance between two different code words. The classical approach to this problem explored in vast literature consists in the inventing explicit constructions of "good codes" and comparing new classes of codes with earlier ones. Less classical approach studies the geometry of the whole set of code points (R,delta) (with q fixed), at first independently of its computability properties, and only afterwords turning to the problems of computability, analogies with statistical physics etc. The main purpose of this article consists in extending this latter strategy to domain of spherical codes.



There are no comments yet.


page 1

page 2

page 3

page 4


Error correcting codes from sub-exceeding fonction

In this paper, we present error-correcting codes which are the results o...

The Typical Non-Linear Code over Large Alphabets

We consider the problem of describing the typical (possibly) non-linear ...

Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric

This work investigates the structure of rank-metric codes in connection ...

On Grid Codes

If A_i is finite alphabet for i=1,...,n, the Manhattan distance is defin...

Three Combinatorial Perspectives on Minimal Codes

We develop three approaches of combinatorial flavour to study the struct...

Constructive Spherical Codes by Hopf Foliations

We present a new systematic approach to constructing spherical codes in ...

Projective toric codes

Any integral convex polytope P in R^N provides a N-dimensional toric var...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.