215 search results - page 1 / 43 » The asymptotic number of binary codes and binary matroids |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
: The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The decomposition theory of matroids initiated by Paul Seymour in the 1980's has had an enormous impact on research in matroid theory. This theory, when applied to matrices ov...
COMBINATORICS
2002
13 years 7 months ago
2002
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
DCC
2007
IEEE
13 years 7 months ago
2007
IEEE
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...