Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CORR
2004
Springer

favoriteEmaildiscussreport

102views Education» more CORR 2004»

The asymptotic number of binary codes and binary matroids

13 years 4 months ago

The asymptotic number of binary codes and binary matroids

Download academic.sun.ac.za

: The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.

Marcel Wild

Real-time Traffic

Asymptotic Number | CORR 2004 | Education | Nonequivalent Binary N-codes |

claim paper

Related Content

» A Decomposition Theory for Binary Linear Codes

» On the Excluded Minors for Matroids of BranchWidth Three

» Some Results on the Binary Minimum Distance of ReedSolomon Codes and Block Turbo Codes

» Practical Binary Adaptive Block Coder

» Coding objects related to Catalan numbers

» On Kissing Numbers in Dimensions 32 to 128

» Average Stopping Set Weight Distributions of Redundant Random Ensembles

» Generalized and doubly generalized LDPC codes with random component codes for the binary e...

» Asymptotic efficiency of twostage disjunctive testing

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CORR
Authors	Marcel Wild

Comments (0)