๐”– Bobbio Scriptorium
โœฆ   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


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
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