The parameters of a linear block code over the finite field Fq of length n, dimension k and minimum distance d will be denoted by [n, k, d]q or [n, k, d]. The quotient k/n is called the information rate and denoted by R = k/n and the relative minimum distance d/n is denoted by δ. A sequence of codes (Cm|m ∈ N) with parameters [nm, km, dm] over a fixed finite field Fq is called asymptotically go...

highly cited papers are mostly authored in international collaboration. it is expected that   co-authored papers bring more citations. on the other hand, it is inevitable that a part of citations is self-citation. this study investigates 134 and 236 highly cited papers in iran and turkey, respectively, to determine the extent to which highly cited papers are affected by author self-citation. a ...

The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of t...

Material for an analysis of the pathogenesis and course of acute peripheral arterial ocelusion was provided by patients with acute arterial occlusion in a lower extremity, special arterial injection studies of amputated limbs, arteriograms performed on cadavers, and data from nai experimental investigation of acute femoral artery embolism in dogs. This correlative study offers a basis for the e...