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

Estimation in a semiparametric model by the method of minimum distance

โœ Scribed by Gangaji Maguluri

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
492 KB
Volume
30
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficiency of a Liu-type estimator in se
Efficiency of a Liu-type estimator in semiparametric regression models
โœ Esra Akdeniz Duran; Fikri Akdeniz; Hongchang Hu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 337 KB

In this paper we consider the semiparametric regression model, y Hu [11] proposed ridge regression estimator in a semiparametric regression model. We introduce a Liu-type (combined ridge-Stein) estimator (LTE) in a semiparametric regression model. Firstly, Liu-type estimators of both ฮฒ and f are att

Estimation of a semiparametric recursive
Estimation of a semiparametric recursive bivariate probit model in the presence of endogeneity
โœ Giampiero Marra; Rosalba Radice ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ French โš– 255 KB

The classic recursive bivariate probit model is of particular interest to researchers since it allows for the estimation of the treatment effect that a binary endogenous variable has on a binary outcome in the presence of unobservables. In this article, the authors consider the semiparametric versio

Estimating the minimum distance of large
Estimating the minimum distance of large-block turbo codes using iterative multiple-impulse methods
โœ Crozier, Stewart ;Guinand, Paul ;Hunt, Andrew ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 2 views

## Abstract A difficult problem for turbo codes is the efficient and accurate determination of the distance spectrum, or even just the minimum distance, for specific interleavers. This is especially true for large blocks, with many thousands of data bits, if the distance is high. This paper compare

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