W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.

Recently, we [1] proposed a simple-to-implement heuristic, namely, BIT-FILLING, for constructing high rate and high girth LDPC codes. In the present work, we extend BIT-FILLING, and demonstrate that the extended algorithm produces better codes, that is, codes with higher rate/girth and good bit error rate performance. We demonstrate the positive effect of girth on bit error rate performance.

In this present research paper analysis of the performance tractor-operated sugarcane leaf stripper is performed. India second-largest producer and Sugarcane most prominent cash crop. The harvesting process labour intensive takes around 850-1000 working man-hours per hectare when harvested manually de-trashing alone 400 in manual procedures for removal tops.
 Mechanized developed fabricate...

The girth of a finitely generated group G is defined to be the supremum of the girth of its Cayley graphs. Let G be a finitely generated subgroup of the mapping class group ModΣ, where Σ is an orientable closed surface with a finite number of punctures and with a finite number of components. We show that G is either a non-cyclic group with infinite girth or a virtually free-abelian group; these...

in this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. finally, we show that the free distance of the convolution...

We investigate the basic interplay between the small k-valent vertex-transitive graphs of girth g and the (k, g)-cages, the smallest k-valent graphs of girth g. We prove the existence of k-valent Cayley graphs of girth g for every pair of parameters k ≥ 2 and g ≥ 3, improve the lower bounds on the order of the smallest (k, g) vertex-transitive graphs for certain families with prime power girth,...

Invasive surgical procedures for gastric volume reduction or bypass have been considered the most effective approach to sustainable long-term weight reduction. However, non-invasive techniques for dynamic volume reduction from inside the stomach are lacking. The aim of this study was to propose temporary, permeable, controllable pseudobezoars for non-invasive, long-term sustainable gastric volu...