In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

In this paper a new patch-based digital signature (DS) is proposed. The proposed approach similar to steganography methods hides the secure message in a host image. However, it uses a patch-based key to encode/decode the data like cryptography approaches. Both the host image and key patches are randomly initialized. The proposed approach consists of encoding and decoding algorithms. The encodin...

The security of code-based cryptography relies primarily on the hardness generic decoding with linear codes. best algorithms are all improvements an old algorithm due to Prange: they known under name information set decoders (ISD). A while ago, a which does not belong this family was proposed: statistical decoding. It is randomized that requires computation large parity-checks moderate weight, ...

We consider the following game introduced by Chung, Graham, and Leighton in [Chung et al. 01]. One player, A, picks k > 1 secrets from a universe of N possible secrets, and another player, B, tries to gain as much information about this set as possible by asking binary questions f : [N ] −→ {0, 1}. Upon receiving a question f , A adversarially chooses one of her k secrets, and answers f accordi...

An upper bound is given on the cutoff rate of discrete memoryless channels. This upper bound, which coincides with a known lower bound, determines the cutoff rate, and settles a long-standing open problem.

In [1] we derived one shot achievable and converse bounds with possible mismatched decoding. In this paper, we extend the results to the list decoding case.

Reconstructing stimuli from the spike trains of neurons is an important approach for understanding the neural code. One of the difficulties associated with this task is that signals which are varying continuously in time are encoded into sequences of discrete events or spikes. An important problem is to determine how much information about the continuously varying stimulus can be extracted from...

Humans are biased toward social interaction. Behaviorally, this bias is evident in the rapid effects that self-relevant communicative signals have on attention and perceptual systems. The processing of communicative cues recruits a wide network of brain regions, including mentalizing systems. Relatively less work, however, has examined the timing of the processing of self-relevant communicative...