Results 231 to 240 of about 641,465 (260)

On Tanner Codes: Minimum Distance and Decoding

Applicable Algebra in Engineering, Communication and Computing, 2003
A result of Zémor on the edge density of a subgraph of a \(d\)-regular graph is generalized to give a bound on the minimum distance of Tanner codes. This is the only bound on the minimum distance of Tanner codes obtained from arbitrary \((c,d)\)-regular bipartite graphs. Also the bound on the minimum distance of expander codes of \textit{M. Sipser} and
Heeralal Janwa, Arbind K. Lal
openaire   +1 more source

The Geometry of Minimum Distance

CoRR, 2023
John Pawlina, Stefan O. Tohaneanu
openaire   +1 more source

On the minimum distance of concatenated codes and decoding based on the true minimum distance

Proceedings of IEEE International Symposium on Information Theory, 2002
We show some conditions that the minimum distance of concatenated codes is beyond the lower bound. Furthermore a new decoding method is proposed up to the true minimum distance.
T. Kohnosu, T. Nishijima, S. Hirasawa
openaire   +1 more source

Minimum distance estimators

Journal of Statistical Planning and Inference, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hettmansperger, T. P., Hueter, I., Hüsler, J.   +2 more
openaire   +1 more source

Minimum‐distance methods based on quadratic distances for transforms

Canadian Journal of Statistics, 1987
AbstractA class of minimum‐distance methods based on empirical transforms is considered. This class includes the minimum‐chi‐squared method, the K‐L method for empirical characteristic functions, and the analogous method for empirical moment generating functions.
Luong, A., Thompson, M. E.
openaire   +2 more sources

The rectilinear distance minisum problem with minimum distance constraints:

Location Science, 1995
Summary: This paper describes a mathematical model for locating a single facility on a continuous plane, which considers transportation (or service) costs between the facility and a set of demand points as well as social costs arising from the undesirable characteristics of the facility.
Brimberg, J., Wesolowsky, G. O.
openaire   +2 more sources

Minimum distance estimates

Journal of Mathematical Sciences, 2007
In the paper, we consider the estimation problem for an unknown density on independent observations. We use the minimum distance estimation method. It is shown that the accuracy of estimation is connected with the rate of increase of the entropy of the parametrical set. Bibliography: 9 titles.
openaire   +1 more source

Channel shaping to maximize minimum distance

IEEE Transactions on Information Theory, 1993
Summary: Suppose that \(N\) inputs to a linear, time-invariant channel are designed to maximize the minimum \(L_ 2\) distance between channel outputs. It is assumed that all inputs are zero outside the finite time window \([-T,T]\) and are constrained in energy. The jointly optimal inputs and channel frequency \(H(f)\) for which the minimum distance is
openaire   +1 more source

Minimum Distance Estimation

1994
We introduce a new class of estimators — minimum distance estimators — and describe their properties in regular and nonstandard situations. These estimators, in the regular case of Hilbert metrics, are consistent and asymptotically normal. In nonstandard situations, their behavior is similar to the behavior of the MLE.
openaire   +1 more source

Minimum Distance Estimators

2002
The practice of obtaining estimators of parameters by minimizing a certain distance between some functions of observations and parameters has long been present in statistics. The classical examples of this method are the Least Square and the minimum Chi Square estimators.
openaire   +1 more source