Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 88 for “"Minimum Distance"”.
-
Selecting tuning parameters in minimum distance estimators
Many minimum distance estimators have the potential to provide parameter estimates which are both robust and efficient and yet, despite these highly desirable theoretical properties, they are rarely used in practice. This is because the performance of these estimators is rarely guaranteed per se …
-
An Improvement to Generalized - Minimum - Distance Decoding
The generalized-minimum-distance decoding algorithm developed by Forney combined an efficient method of finding candidate codewords with an acceptance criterion. If a codeword meets the acceptance criterion, then it is known to have smaller generalized distance than any other element of the code. …
-
Denoising by wavelet thresholding using multivariate minimum distance partial density estimation
… in density estimation which minimizes an distance criterion (L2E) to estimate the parameters of the partial density that represents the noise component. The L2E estimate for the weight of the noise component, w&d4;L2E , determines the fraction of wavelet coefficients that the algorithm …
-
Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness
We study the minimum distance of binary error correcting codes from the following perspectives: * The problem of deriving bounds on the minimum distance of a code given constraints on the computational complexity of its encoder. * The minimum distance of linear codes that are symmetric in the sense …
-
On the Minimum Distance Structure of Cyclic Codes and Decoding Beyond Thebch Bound
Made available in DSpace on 2014-12-10T19:06:31Z (GMT). No. of bitstreams: 1 7105117.pdf: 2016792 bytes, checksum: 30cff40663e99e58b7de80c1c08e6d1f (MD5) Previous issue date: 1970
-
Design and implementation of a K=3, rate 1/2, 110/111 minimum-distance feedback decoder
Digitized by Kansas Correctional Industries
-
Error Bounds Between the Minimum Distance Energy of an Equilateral Knot and the Mobius Energy of an Inscribed Smooth Knot
… we explore the question of whether or not the Minimum Distance Energy of an equilateral knot is close to the Mobius Energy of a smooth knot where the smooth knot is inscribed in the equilateral knot in a specific way.
-
Applications of Algebraic Curves to Cryptography
… a method to find the lower bounds for the minimum distance of geometric codes. We apply this to the two-point codes on a Hermitian function field. The lower bounds turn out to be sharp and they meet the formulas by Homma and Kim for the actual minimum distance of the Hermitian two-point …
-
Algorithms and Architectures for Soft -Decoding Reed -Solomon Codes
… and complexity requirements, generalized minimum distance decoding with maximum a priori soft-detection is selected, and the corresponding architecture is developed. The generalized minimum distance decoder is expected to give 0.5 dB gain over a hard-decoder at the target bit error-rate of …
-
A new approach to fitting linear models in high dimensional spaces
… part of pace regression. A measure-based minimum distance approach, including probability measures and nonnegative measures, is proposed, and strongly consistent estimators are produced. Of all minimum distance methods for estimating a mixing distribution, only the …
-
Comparison of accuracy and efficiency of five digital image classification algorithms
… with a spatial constraint) b) ISODATA (a hybrid minimum distance classifier) c) BOXDEC (a discrete parallelepiped classifier) d) BCLAS (a Bayesian classifier) e) HYPBOX (a combined parallelepiped-Bayesian classifier) Two sets of training data, developed for each study site were combined with each …
-
A central facilities location problem involving traveling salesman tours and expected distances
… heuristic solution procedures for determining minimum distance locations. Despite the wide applicability of the traveling salesman location problem, a survey of the facilities location literature revealed that this research effort apparently was the first to address the problem. After …
-
Managing Agent Sampling Probabilities in Irregular Networks
… are often modeled by small-world, scale-free, minimum-distance, or random (SFMR) graphs. If agents randomly wander nodes, then the irregularity found in these types of graphs gives rise to some nodes being visited more often than others. Assuming the system requires agents to uniformly visit …
-
On estimation and goodness-of-fit testing for the Pareto distribution
… to techniques based on the minimisation of some distance measure. Interestingly, these minimum distance estimators outperform the classical techniques in various settings. The use of the goodness-of-fit tests developed in the thesis are illustrated using practical data. The same holds for the …
-
Channel Estimation in Single -Carrier and Multi-Carrier Communication Systems
… for single-carrier systems as the linear optimal minimum-mean-squared-error (LMMSE) estimator. Analysis of this estimator and a related hard decision-based channel estimator is carried out in the context of turbo equalization under Gaussian assumptions of the output of the soft-input/soft-output …
-
Multiplicative codes of Reed-Muller type
… We also study the AB method to analyze the minimum distance of linear codes. The multiplicative codes of Reed-Muller type and the AB method are connected when we study the distance and dual distance of a code and its square. Generator matrices for our codes use a combination of blocks, where …
-
Avoiding Spoilers on Mediawiki Fan Sites Using Memento
… page to give back to the user, currently using a minimum distance heuristic. We quantify how this heuristic is inadequate for avoiding spoilers, analyzing data collected from fan wikis and the Internet Archive. We create an algorithm for calculating the probability of encountering a spoiler in a …
-
Detecting the socioeconomic conditions of urban neighborhoods through wavelet analysis of remotely sensed imagery
… than linear discriminant analysis and the minimum-distance classifier based on wavelet measures of urban land covers; 2) wavelet textural measures could be used to efficiently discriminate among urban neighborhoods of different social-economic conditions; 3) image resolution had great …
-
Essays in weak identification
… chapter, joint with Anna Mikusheva, we consider minimum distance statistics and show that in a broad class of models the problem of testing under weak identification is closely related to the problem of testing a "curved null" in a finite-sample Gaussian model. Using the curvature of the model, …
-
Design and analysis of spherical codes
… that are asymptotically optimal with respect to minimum distance, and the first construction can be efficiently used as part of a vector quantizer for a memoryless Gaussian source. Both constructions are structured so that codepoints may be identified without having to store the entire codebook. …
Page 1 of 5