We present a device-independent quantum scheme for the Byzantine Generals problem. The protocol is for three parties. Party C is to send two identical one bit messages to parties A and B. The receivers A and B may exchange two one bit messages informing the other party on the message received from C. A bit flipping error in one of the transmissions, does not allow the receiving parties to estab...

Decoding and Turbo Equalization (TEQ) algorithms based on the Sum-Product Algorithm (SPA) are well established for LDPC codes. However there is increasing interest in linear and nonlinear programming (NLP)-based decoders which may offer computational and performance advantages over the SPA. We present NLP decoders and Turbo equalizers based on an Augmented Lagrangian formulation of the decoding...

The Haft Saravan area is located in 90 km SE Arak in the central Iran. This area is a part of Malyer-Isfahan metallogenic belt. The article's objective is determining the most suitable method for identifying mineralized zones using original singularity and weighted singularity methods in three-dimensional space. In weighted singularity method, mineralized zones have a greater volume relative to...

The most common uses of negatively weighted bits (negabits), normally assuming the arithmetic value −1 (respectively 0) for logical 1 (0) state, are as the most significant bit of 2’s-complement numbers and as the negative component in binary signed-digit (BSD) representation. More recently, weighted bit-set (WBS) encoding of generalized digit sets and the practice of inverted encoding of negab...

The 1-D Teager algorithm can be used to perform mean weighted highpass filtering with relatively few operations. We propose a generalization of the Teager algorithm. The modified algorithm allows us to adjust the dependence of the highpass output on the local mean. The derivation and interpretation of the modified algorithm is presented. Finally, the response of several implementations to a tes...

This work presents a new code-based key encapsulation mechanism (KEM) called LEDAkem. It is built on the Niederreiter cryptosystem and relies on quasi-cyclic low-density parity-check codes as secret codes, providing high decoding speeds and compact keypairs. LEDAkem uses ephemeral keys to foil known statistical attacks, and takes advantage of a new decoding algorithm that provides faster decodi...

A wavelet ECG data codec based on the Set Partitioning In Hierarchical Trees (SPIHT) compression algorithm is proposed in this paper. The SPIHT algorithm [1] has achieved notable success in still image coding. We modified the algorithm for the one-dimensional (1-D) case and applied it to compression of ECG data. Experiments on selected records from the MIT-BIH arrhythmia database revealed that ...