Sökning: "Binary sequences"
Visar resultat 1 - 5 av 17 avhandlingar innehållade orden Binary sequences.
1. Topics in convex and mixed binary linear optimization
Sammanfattning : This thesis concerns theory, algorithms, and applications for two problem classes within the realm of mathematical optimization; convex optimization and mixed binary linear optimization. To the thesis is appended five papers containing its main contributions. LÄS MER
2. A non-probabilistic approach to binary electronic fingerprinting
Sammanfattning : Electronic fingerprinting deals with the problem of object identification through the use of electronic marks, unique to each object. We consider fingerprinting for the purpose of tracing the origins of illegitimately copied and distributed data, so called pirate copies. LÄS MER
3. Computational problems in evolution : Multiple alignment, genome rearrangements, and tree reconstruction
Sammanfattning : Reconstructing the evolutionary history of a set of species is a fundamental problem in biology. This thesis concerns computational problems that arise in different settings and stages of phylogenetic tree reconstruction, but also in other contexts. LÄS MER
4. On Sequence Design for Integrated Radar and Communication Systems
Sammanfattning : The motivation of having a joint radar and communication system on a single hardware is driven by space, military, and commercial applications. However, designing sequences that can simultaneously support radar and communication functionalities is one of the major hurdles in the practical implementation of these systems. LÄS MER
5. Cyclically permutable codes
Sammanfattning : A cyclically permutable code is a set of codewords having the property that no codeword is a cyclic shift of another codeword. We study the problem of constructing cyclically permutable codes of large size and low correlation.Cyclically permutable codes are used in code-division multiple-access systems realized by e.g. LÄS MER