The asymptotic number of binary codes and binary matroids

Details The asymptotic number of binary codes and binary matroids The asymptotic number of binary codes and binary matroids

2004-08-04

arxiv.org/abs/cs/0408011v1

SIAM Journal of Discrete Mathematics 19 (2005) 691-699

Computer Science

Information Theory

12 pages

Scientific paper

The asyptotic number of nonequivalent binary n-codes is determined. This is
also the asymptotic number of nonisomorphic binary n-matroids. The connection
to a result of Lefmann, Roedl, Phelps is explored. The latter states that
almost all binary n-codes have a trivial automorphism group.

Affiliated with

Also associated with

No associations

Rating

The asymptotic number of binary codes and binary matroids 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 The asymptotic number of binary codes and binary matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The asymptotic number of binary codes and binary matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-584639