arXiv subjects

René Ndoundam

Publications and source records attributed to René Ndoundam.

4 recordsLinked to original sources

arXiv2020

Two high capacity text steganography schemes based on color coding

Text steganography is a mechanism of hiding secret text message inside another text as a covering message. In this paper, we propose a text steganographic scheme based on color coding. This include two different methods: the first based on permutation, and the second based on numeration systems. Given a secret message and a cover text, the proposed schemes embed the secret message in the cover text by making it colored. The stego-text is then sent to the receiver by mail. After experiments, the results obtained show that our models performs a better hiding process in terms of hiding capacity as compared to the scheme of Aruna Malik et al. in which our idea is based.

cs.CR↗

arXiv2012

Period-halving Bifurcation of a Neuronal Recurrence Equation

We study the sequences generated by neuronal recurrence equations of the form $x(n) = {\bf 1}[\sum_{j=1}^{h} a_{j} x(n-j)- θ]$. From a neuronal recurrence equation of memory size $h$ which describes a cycle of length $ρ(m) \times lcm(p_0, p_1,..., p_{-1+ρ(m)})$, we construct a set of $ρ(m)$ neuronal recurrence equations whose dynamics describe respectively the transient of length $O(ρ(m) \times lcm(p_0, ..., p_{d}))$ and the cycle of length $O(ρ(m) \times lcm(p_{d+1}, ..., p_{-1+ρ(m)}))$ if $0 \leq d \leq -2+ρ(m)$ and 1 if $d=ρ(m)-1$. This result shows the exponential time of the convergence of neuronal recurrence equation to fixed points and the existence of the period-halving bifurcation.

cs.NE↗

arXiv2010

Parallel Chip Firing Game associated with n-cube orientations

We study the cycles generated by the chip firing game associated with n-cube orientations. We show the existence of the cycles generated by parallel evolutions of even lengths from 2 to $2^n$ on $H_n$ (n >= 1), and of odd lengths different from 3 and ranging from 1 to $2^{n-1}-1$ on $H_n$ (n >= 4).

cs.DM↗

arXiv2006

Réseaux d'Automates de Caianiello Revisité

We exhibit a family of neural networks of McCulloch and Pitts of size $2nk+2$ which can be simulated by a neural networks of Caianiello of size $2n+2$ and memory length $k$. This simulation allows us to find again one of the result of the following article: [Cycles exponentiels des réseaux de Caianiello et compteurs en arithmétique redondante, Technique et Science Informatiques Vol. 19, pages 985-1008] on the existence of neural networks of Caianiello of size $2n+2$ and memory length $k$ which describes a cycle of length $k \times 2^{nk}$.

cs.NE↗