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...

HE practical importance of Reed-Solomon codes is well established (see [1]-[7]). The application of Reed-Solomon codes spans from deep-space communication standard [2] -[4] and over the air teletext broadcast [5] to frequency-hop spreadspectrum systems [6] and optical communication [7]. Harddecision decoders for RS codes are readily available using algebraic decoding algorithms. Such ...

Natural language understanding (NLU) focusing on machine reading comprehension is a branch of natural language processing (NLP). The domain of the developing NLU system covers from sentence decoding to text understanding and the automatic decoding of GP sentence belongs to the domain of NLU system. GP sentence is a special linguistic phenomenon in which processing breakdown and backtracking are...

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...

In current speech applications, facilities to correct recognition errors are limited to either choosing among alternative hypotheses (either by voice or by mouseclick) or respeaking. Information from the context a repair is ignored. We developed a method which improves the accuracy of correcting speech recognition errors interactively by taking into account the context of the repair interaction...

We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our first pair of theorems establish that there exist codes from this ensemble, with all degrees remaining bounded independently of block length, that are simultaneously optimal as bot...

We present an approach called VisCode for embedding information into visualization images. This technology can implicitly embed data specified by the user a while ensuring that encoded image is not distorted. The framework based on deep neural network. propose to use images and QR codes as training design robust encoder-decoder designed model considers salient features of reduce explicit visual...

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...