The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids

被引：13

作者：

Wild, M ^{[1
]}

机构：

[1] Univ Stellenbosch, ZA-7602 Stellenbosch, South Africa

来源：

FINITE FIELDS AND THEIR APPLICATIONS | 2000年 / 6卷 / 02期

关键词：

D O I：

10.1006/ffta.1999.0273

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The asymptotic value as n --> infinity of the number b(n) of inequivalent binary n-codes is determined. It was long known that b(n) also gives the number of nonisomorphic binary n-matroids. (C) 2000 Academic Press.

引用

页码：192 / 202

页数：11

共 12 条

[1]

[Anonymous], INTRO PROBABILITY TH

[2]

[Anonymous], 1983, ENCY MATH APPL

[3]

[Anonymous], 1992, ENCY MATH ITS APPL

[4]

BETTEN A, 1998, CODIERUNGSTHEORIE

[5] INVARIANT SUBSPACE LATTICE OF A LINEAR TRANSFORMATION [J].

BRICKMAN, L ;

FILLMORE, PA .

CANADIAN JOURNAL OF MATHEMATICS, 1967, 19 (04) :810-&

[6]

DAY A, 1988, ORDER, V5, P85

[7]

Goldman J., 1969, RECENT PROGR COMBINA, P75

[8]

VOGT F, 1995, LATTICE THEORY ITS A, P241

[9]

Welsh D.J.A., 1976, Matroid Theory

[10] AXIOMATIZING SIMPLE BINARY MATROIDS BY THEIR CLOSED CIRCUITS [J].

WILD, M .

APPLIED MATHEMATICS LETTERS, 1993, 6 (06) :39-40

← 1 2 →