On the number of 1-perfect binary codes: a lower bound

Details On the number of 1-perfect binary codes: a lower bound On the number of 1-perfect binary codes: a lower bound

2006-08-11

arxiv.org/abs/math/0608278v3

IEEE Trans. Inf. Theory 54(4) 2008, 1760-1765

Mathematics

Combinatorics

5pp(Eng)+7pp(Rus) V2: revised V3: + Russian version, + references

Scientific paper

10.1109/TIT.2008.917692

We present a construction of 1-perfect binary codes, which gives a new lower
bound on the number of such codes. We conjecture that this lower bound is
asymptotically tight.

Affiliated with

Also associated with

No associations

Rating

On the number of 1-perfect binary codes: a lower bound does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the number of 1-perfect binary codes: a lower bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the number of 1-perfect binary codes: a lower bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-547555