We show that the Feng-Rao bound for dual codes and a similar bound by Andersen and Geil [1] for primary codes are consequences of each other. This implies that the Feng-Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance. The technique applies to any linear code for which information on well-behaving pairs is available. Consequently we are ab...

In this work we propose a Bayesian version of the Nagaoka-Hayashi bound when estimating parametric family quantum states. This lower is generalization recently proposed for point estimation to estimation. We then show that can be efficiently computed as semidefinite programming problem. As bound, also derive Holevo-type from bound. Lastly, prove new tighter than Cramér-Rao bounds.

In this work we study the performance of elevation estimators and lower bounds on the estimation error variance for a low angle target in a smooth sea scenario using an array antenna. The article is structured around some key assumptions on multipath knowledge, signal parameterization and noise covariance, giving the reader a framework in which Maximum-Likelihood estimators exploiting di erent ...

On the structure of non-full-rank perfect codes Denis S. Krotov Sobolev Institute of Mathematics and Mechanics and Mathematics Department, Novosibirsk State University Novosibirsk, Russia The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-errorcorrecting binary code can be constructed by this co...

In this paper we study a generalization of Kruskal’s permutation lemma to partitioned matrices. We define the k’-rank of partitioned matrices as a generalization of the k-rank of matrices. We derive a lower-bound on the k’-rank of Khatri–Rao products of partitioned matrices. We prove that Khatri–Rao products of partitioned matrices are generically full column rank.

An expression is derived for a Cramer-Rao lower bound on the variance of unbiased estimators of complex parameters.

This paper deals with on-line Bayesian Cramer-Rao (BCRB) lower bound for complex gains dynamic estimation of time-varying multi-path Rayleigh channels. We propose three novel lower bounds for 4QAM OFDM systems in case of negligible channel variation within one symbol, and assuming both channel delay and Doppler frequency related information. We derive the true BCRB for data-aided (DA) context a...