The asymptotic number of binary codes and binary matroids

dc.contributor.authorWild, Marcel
dc.date.accessioned2012-07-31T08:52:31Z
dc.date.available2012-07-31T08:52:31Z
dc.date.issued2006-08
dc.descriptionThe original publication is available at http://epubs.siam.org/en_ZA
dc.description.abstractThe asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary matroids on n elements.en_ZA
dc.description.versionPublishers' Versionen_ZA
dc.format.extentp. 691-699
dc.identifier.citationWild, M. 2006. The asymptotic number of binary codes and binary matroids. SIAM Journal on Discrete Mathematics, 19(3):691-699, doi:10.1137/S0895480104445538.en_ZA
dc.identifier.issn1095-7146 (online)
dc.identifier.issn0895-4801 (print)
dc.identifier.otherdoi:10.1137/S0895480104445538
dc.identifier.urihttp://hdl.handle.net/10019.1/21904
dc.language.isoen_ZAen_ZA
dc.publisherSociety for Industrial and Applied Mathematics (SIAM)en_ZA
dc.rights.holderSIAM Journal on Discrete Mathematicsen_ZA
dc.subjectAsymptotic enumerationen_ZA
dc.subjectBinary codesen_ZA
dc.subjectBinary matroidsen_ZA
dc.subjectLattice of invariant subspacesen_ZA
dc.titleThe asymptotic number of binary codes and binary matroidsen_ZA
dc.typeArticleen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
wild_asymptotic_2006.pdf
Size:
154.11 KB
Format:
Adobe Portable Document Format
Description:
Publishers' Version
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.95 KB
Format:
Item-specific license agreed upon to submission
Description: