Search for dissertations about: "minimum distance"
Showing result 11 - 15 of 90 swedish dissertations containing the words minimum distance.
-
11. Sensitivity, Variation, and Application of Least-Cost Path Models in Landscape Connectivity Analysis and Corridor Planning
Abstract : In recent decades, Rwanda has been affected by the loss and fragmentation of natural habitats for native species of animals and plants. As a consequence, landscape connectivity—i.e. READ MORE
-
12. Plasma environment of an intermediately active comet : Evolution and dynamics observed by ESA's Rosetta spacecraft at 67P/Churyumov-Gerasimenko
Abstract : The subject of this thesis is the evolution and dynamics of the plasma environment of a moderately active comet before, during and after its closest approach to the Sun. For over 2 years in 2014-2016, the European Space Agency’s Rosetta spacecraft followed the comet 67P/Churyumov-Gerasimenko at distances typically between a few tens and a few hundred kilometers from the nucleus, the longest and closest inspection of a comet ever made. READ MORE
-
13. Secure GNSS-based Positioning and Timing : Distance-Decreasing attacks, fault detection and exclusion, and attack detection with the help of opportunistic signals
Abstract : With trillions of devices connected in large scale systems in a wired or wireless manner, positioning and synchronization become vital. Global Navigation Satellite System (GNSS) is the first choice to provide global coverage for positioning and synchronization services. READ MORE
-
14. Bounds on the Performance of PSK Block Codes
Abstract : In wireless communication, the minimum Euclidean distance between codewords is a major factor for the ability to correct errors in messages, and it is of interest to maximize the minimum Euclidean distance. The thesis improves previously established general upper bounds on minimum Euclidean distance of phase shift keying block codes. READ MORE
-
15. Ternary Codes with Weight Constraints
Abstract : We study the problem of maximizing the size of a ternary block code with given length and minimum Hamming distance. The problem is further restricted in two different ways. Either we require all codewords to have constant Hamming weight, or we require all codewords to have constant composition. READ MORE