| In this paper, we present a design method for AND-OR-EXOR three-level networks, where a single two-input EXOR gate is used. The network realizes an exclusive-OR of two sum-of-products expressions (EX-SOP), where the two sum-of-products expressions (SOP) cannot share products. The problem is to minimize the total number of product in the two SOPs. We introduced the -equivalence of logic functi...

Non-local games are widely studied as a model to investigate the properties of quantum mechanics as opposed to classical mechanics. In this paper, we consider a subset of non-local games: symmetric XOR games of n players with 0-1 valued questions. For this class of games, each player receives an input bit and responds with an output bit without communicating to the other players. The winning co...

In two-way relay channels, bitwise XOR and symbol-level superposition coding are two popularnetwork-coding based relaying schemes. However, neither of them can approach the capacity boundwhen the channels in the broadcast phase are asymmetric. In this paper, we present a new physicallayer network coding (PLNC) scheme, called superimposed XOR. The new scheme advances the existing...

In this work we analyze performance of network coding focusing on two specific network coding schemes: XOR and random linear network coding. We have simulated different topologies and traffic patterns in order to provide better understanding of network coding behavior and its possible bottlenecks. As a part of our performance evaluation we consider also computational complexity of coding and de...

An XOR function is a function of the form g(x, y) = f(x ⊕ y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f . We also show that, when f is monotone, g’s quantum and classical complexities are quadratically related, and that ...

Zimand [24] presented simple constructions of locally computable strong extractors whose analysis relies on the direct product theorem for one-way functions and on the Blum-Micali-Yao generator. For N -bit sources of entropy γN , his extractor has seed O(logN) and extracts N random bits. We show that his construction can be analyzed based solely on the direct product theorem for general functio...

This paper concerns with the construction of codes over GF (2) which reach the max-flow for single source multicast acyclic networks with delay. The coding is always a bitwise XOR of packets with equal lengths, and is based on highly symmetrical and balanced designs. For certain setups and parameters, our approach offers additional plausible security properties: an adversary needs to eavesdrop ...

Physical Unclonable Functions (PUFs) are seen as a promising alternative to traditional cryptographic algorithms for secure and lightweight device authentication. However, most strong PUF proposals can be attacked using machine learning algorithms in which a precise software model of the PUF is determined. One of the most popular strong PUFs is the XOR Arbiter PUF. In this paper we examine the ...

Abstract— Compromised senders and pollution attacks are the key issues in designing and operating in any network either it is a wired or wireless (especially in applications like sensor networks, lossy wireless networks etc.) XOR network coding, an extension of Network coding is a new research area in information theory. It is a paradigm in which intermediate nodes are allowed to create new pac...

—We consider the conditions how two binary numbers can be superimposed on the same track with the use of different recording magnetic fields. As a result the average magnetization of longitudinal medium along the track can have three states:-M, 0 and +M. Possibility to perform logic operations with these states is considered. We demonstrate OR, AND, XOR and NOT operations and discuss a modifica...