In this paper, we present a data hiding algorithm for binary document images. This algorithm is based on the DistanceReciprocal Distortion Measure [1] that is used to evaluate the amount of distortion caused by flipping a particular pixel in binary document images. The pixels that will cause less distortion after flipping are preferred candidates for flipping. We do the embedding by enforcing t...

Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of landscapes and Krawtchouk polynomials to exactly compute the probability distribution of fitness values of a binary string undergoing uniform bit-flip mutation. We prove that this probability distribution can be expre...

Hamming codes are widely used for the single bit error correction double bit error detection (SEC-DED) which occurred during data transmission process. This paper presents an enhanced detection of double adjacent bit errors and correcting all possible single bit errors in Hamming codes through selective bit placement technique for memory application. Soft errors occur due to the radiation parti...

In this paper we present an efficient algorithm to decode linear block codes on binary channels. The main idea consists in using a vote procedure in order to elaborate artificial reliabilities of the binary received word and to present the obtained real vector r as inputs of a SIHO decoder (Soft In/Hard Out). The goal of the latter is to try to find the closest codeword to r in terms of the Euc...

Symbol flipping-based hard decision decoding for non-binary low-density parity check (LDPC) codes has attracted much attention due to low decoding complexity even though the error performance of the symbol flipping decoder is inferior to that of the soft decision decoders. Standard symbol flipping decoding involves two steps, selection of the symbol position to be flipped and selection of the f...

We prove that a stack of n pancakes is rearranged in all n! ways by repeatedly applying the following rule: Flip the maximum number of pancakes that gives a new stack. This complements the previously known pancake flipping Gray code (S. Zaks, A New Algorithm for Generation of Permutations BIT 24 (1984), 196–204) which we also describe as a greedy algorithm: Flip the minimum number of pancakes t...

a r t i c l e i n f o a b s t r a c t Keywords: Uniform crossover Bit-flip mutation Walsh decomposition Landscape theory Fitness landscapes Uniform crossover and bit-flip mutation are two popular operators used in genetic algorithms to generate new solutions in an iteration of the algorithm when the solutions are represented by binary strings. We use the Walsh decomposition of pseudo-Boolean fu...