Sökning: "Hamming metric"
Hittade 4 avhandlingar innehållade orden Hamming metric.
1. Consensus Algorithms for Trees and Strings
Sammanfattning : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. LÄS MER
2. Superimposed codes for additive channels
Sammanfattning : We consider a situation where several users send information over a single additive channel. We suppose the transmission is synchronized and that at most m of the total number of potential T users transmit simultaneously. The receiver gets a message which is the sum of the messages of the active users at that moment. LÄS MER
3. Logical Dynamics and Dynamical Systems
Sammanfattning : This thesis is on information dynamics modeled using *dynamic epistemic logic* (DEL). It takes the simple perspective of identifying models with maps, which under a suitable topology may be analyzed as *topological dynamical systems*. It is composed of an introduction and six papers. LÄS MER
4. Using Coding Techniques for Attacking Post-Quantum Cryptographic Assumptions and Systems
Sammanfattning : Post-quantum cryptography for resisting possible attacks from malicious quantum adversaries has become one of the key topics in recent cryptographic research. Its ultimate goal is to search for efficient and secure primitives replacing the factoring- and discrete log-based schemes in service that will be broken in polynomial time by Shor’s algorithm. LÄS MER