Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Mohamad Khalil

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Bassem Bakhache

> Home > Persons > Mohamad Khalil

Publications

2019
[j22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entropy/BattikhAHBDK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/BattikhAHBDK19
Dalia Battikh, Safwan El Assad, Thang Manh Hoang, Bassem Bakhache, Olivier Déforges, Mohamad Khalil:
Comparative Study of Three Steganographic Methods Using a Chaotic System and Their Universal Steganalysis Based on Three Feature Vectors. Entropy 21(8): 748 (2019)
2014
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/iccomm/BattikhABDK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccomm/BattikhABDK14
Dalia Battikh, Safwan El Assad, Bassem Bakhache, Olivier Déforges, Mohamad Khalil:
Steganalysis of a chaos-based steganographic method. COMM 2014: 1-4
2013
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/icitst/BattikhABDK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icitst/BattikhABDK13
Dalia Battikh, Safwan El Assad, Bassem Bakhache, Olivier Déforges, Mohamad Khalil:
Enhancement of two spatial steganography algorithms by using a chaotic system: Comparative analysis. ICITST 2013: 20-25

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.