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

Woven convolutional graph codes with large free distances

โœ Scribed by I. E. Bocharova; F. Hug; R. Johannesson; B. D. Kudryashov

Book ID
110179866
Publisher
SP MAIK Nauka/Interperiodica
Year
2011
Tongue
English
Weight
557 KB
Volume
47
Category
Article
ISSN
0032-9460

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A systematic method for computing the mi
A systematic method for computing the minimum free distance of a convolutional code
โœ Y.Z. Boutros; G.P. Fiani; E.S. Looka ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 626 KB

The minimum free distance of a convolutional code is the most important factor affecting its error correcting capability. An easy to implement, systematic method for computing the minimum free distance is presented. The computer search is minimized by first excluding catastrophic codes, then applyin

Large P4-free graphs with bounded degree
Large P4-free graphs with bounded degree
โœ Myung S. Chung; Douglas B. West ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 424 KB

## Abstract Let __ex__ \* (__D__; __H__) denote the maximum number of edges in a connected graph with maximum degree __D__ and no induced subgraph isomorphic to __H.__ We prove that this is finite only when __H__ is a disjoint union of paths,m in which case we provide crude upper and lower bounds.