A novel fragile watermarking technique is proposed for hiding logo information into an image by tuning block pixels based on a bitmap parity checking approach. A secure key and a random number generator are used to hide the logo information in a secret, undetectable, and unambiguous way. The characteristics of the mean gray value and the bitmap in a block are exploited for performing the embedd...

In a recent paper, it is shown that if Pearl's belief propagation algorithm is applied to the Bayesian belief network of a turbo code, the turbo decoding algorithm immediately results. From this perspective, it is recognized that the turbo coding structure imposes unnecessary diierentiation on the parity checks and the turbo decoding algorithm speciies a seemingly arbitrary sequential activatio...

Quasi-polycyclic (QP for short) codes over a finite chain ring R are generalization of quasi-cyclic codes, and these can be viewed as an R[x]-submodule $${\mathcal {R}}_m^{\ell }$$ , where {R}}_m:= R[x]/\langle f\rangle $$ f is monic polynomial degree m R. If factors uniquely into coprime basic irreducibles, then their algebraic structure allow us to characterize the generator polynomials minim...

When we try to solve a system of linear equations, we can consider a simple iterative algorithm in which an equation including only one variable is chosen at each step, and the variable is fixed to the value satisfying the equation. The dynamics of this algorithm is captured by the peeling algorithm. Analyses of the peeling algorithm on random hypergraphs are required for many problems, e.g., t...

Abstract—Designing good error correcting codes whose generator matrix has a support constraint, i.e., one for which only certain entries of the generator matrix are allowed to be nonzero, has found many recent applications, including in distributed coding and storage, multiple access networks, and weakly secure data exchange. The dual problem, where the parity check matrix has a support constra...

conclusions increment in the number of parity can lead to decrease antioxidant defense mechanisms in multiparous women and their newborns. so, control of oxidative stress is considered to be beneficial in multiparous women. background parturition has been associated with free radicals, itself linked with poor pregnancy outcome. objectives this study aimed to investigate the relationship between...

Two closely-related pseudo-random sequence generators are presented: The lIP generator, with input P a prime, outputs the quotient digits obtained on dividing by P. The x mod N generator with inputs N, Xo (where N P. Q is a product of distinct primes, each congruent to 3 mod 4, and x0 is a quadratic residue mod N), outputs bob1 b2" where bi parity (xi) and xi+ x mod N. From short seeds each gen...

Quantum-dot Cellular Automata (QCA) is a possible future nanoelectronic computing technology, based on cells of coupled quantum dots. The QCA cells have features on the very low nanometer scale, much smaller than the present state of art size of the smallest transistor. This paper presents design and layout of novel XOR gate implementations with minimum complexity and cell count in comparison w...

Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...

Z2Z4-additive codes have been defined as a subgroup of Z r 2 ×Z s 4 in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set Zr2[ξ̄] × Z s 4[ξ] where ξ is the root of a monic basic primitive polynomial in Z4[x]. We give the standard form of the generator and parity-check matrices of codes ...