The asymptotic value as nPR 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.
โฆ LIBER โฆ
The Asymptotic Number of Binary Codes and Binary Matroids
โ Scribed by Wild, Marcel
- Book ID
- 118198913
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2005
- Tongue
- English
- Weight
- 154 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0895-4801
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Asymptotic Number of Inequivalent Bi
โ
Marcel Wild
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 139 KB
On binary k-paving matroids and Reed-Mul
โ
Sanjay Rajpal
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 487 KB
A matroid Jr' of rank r>.k is k-paving if all of its circuits have cardinality exceeding r-k. In this paper, we develop some basic results concerning k-paving matroids and their connections with codes. Also, we determine all binary 2-paving matroids. (~
Optimal Binary Coding of Ordered Numbers
โ
Steiglitz, K.; Bernstein, A. J.
๐
Article
๐
1965
๐
Society for Industrial and Applied Mathematics
โ 248 KB
Asymptotic bounds on the covering radius
โ
Sole, P.
๐
Article
๐
1990
๐
IEEE
๐
English
โ 300 KB
The Penrose Polynomial of Binary Matroid
โ
Martin Aigner; Hans Mielke
๐
Article
๐
2000
๐
Springer Vienna
๐
English
โ 117 KB
The Cocycle Lattice of Binary Matroids
โ
Lรกszlรณ Lovรกsz; รkos Seress
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 330 KB
We study the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual tattice. We characterize those binary matroids for which the obvious necessary conditions for a vector to belong to the cocycle lattice are also sufficient. This characterization yields a poly