On the number of error correcting codes

Abstract: We show that for a fixed

q

, the number of

q

-ary

t

-error correcting codes of length

n

is at most

2^{(1 + o (1)) H_{q} (n, t)}

for all

t l e q (1 - q^{- 1}) n - C_{q} s q r t n l o g n

(for sufficiently large constant

C_{q}

), where

H_{q} (n, t) = q^{n} / V_{q} (n, t)

is the Hamming bound and

V_{q} (n, t)

is the cardinality of the radius

t

Hamming ball. This proves a conjecture of Balogh, Treglown, and Wagner, who showed the result for

t = o (n^{1 / 3} (l o g n)^{- 2 / 3})

.

This page was built for publication: On the number of error correcting codes