๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Asymptotic Number of Inequivalent Binary Codes and Nonisomorphic Binary Matroids

โœ Scribed by Marcel Wild

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
139 KB
Volume
6
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

The construction of periodically time-va
The construction of periodically time-variant convolutional codes using binary linear block codes
โœ Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 483 KB

## Abstract In 1996 Rosenthal and York proposed (timeโ€invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.