The Feng-Rao bound gives good estimates of the minimum distance of a large class of codes. In this work we are concerned with the problem of how to extend the Feng-Rao bound so that it deals with all the generalized Hamming weights. The problem was solved by Heijnen and Pellikaan in [7] for a large family of codes that includes the duals of one-point geometric Goppa codes and the q-ary Reed-Mul...

A fundamental issue in NMR spectroscopy is the estimation of parameters such as the Larmor frequencies of nuclei, J coupling constants, and relaxation rates. The Cramer-Rao lower bound provides a method to assess the best achievable accuracy of parameter estimates resulting from an unbiased estimation procedure. We show how the Cramer-Rao lower bound can be calculated for data obtained from mul...

In this paper we derive a canonical lower bound for the autocovariance function of any unbiased transfer-function estimator. As a generalization of the Cramér-Rao bound, the Cramér-Rao kernel that we define can be derived without parametrizing the model set. The Cramér-Rao kernel is thus one of the cornerstones for experiment design formulations that do not depend on the choice of coordinates.