Abstract
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp threshold point for the density of the linear codes whose relative distance is greater than a given positive number. For arbitrary random codes, similar settings and results are exhibited; in particular, the very sharp threshold point for the density of the codes whose relative distance is greater than a given positive number is located at half the asymptotic Gilbert-Varshamov bound.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.