A Reversible Data Hiding Scheme Based on Code Division Multiplexing

In this paper, a novel code division multiplexing (CDM) algorithm-based reversible data hiding (RDH) scheme is presented. The covert data are denoted by different orthogonal spreading sequences and embedded into the cover image. The original image can be completely recovered after the data have been...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information forensics and security Vol. 11; no. 9; pp. 1914 - 1927
Main Authors Bin Ma, Shi, Yun Q.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract In this paper, a novel code division multiplexing (CDM) algorithm-based reversible data hiding (RDH) scheme is presented. The covert data are denoted by different orthogonal spreading sequences and embedded into the cover image. The original image can be completely recovered after the data have been extracted exactly. The Walsh Hadamard matrix is employed to generate orthogonal spreading sequences, by which the data can be overlappingly embedded without interfering each other, and multilevel data embedding can be utilized to enlarge the embedding capacity. Furthermore, most elements of different spreading sequences are mutually cancelled when they are overlappingly embedded, which maintains the image in good quality even with a high embedding payload. A location-map free method is presented in this paper to save more space for data embedding, and the overflow/underflow problem is solved by shrinking the distribution of the image histogram on both the ends. This would further improve the embedding performance. Experimental results have demonstrated that the CDM-based RDH scheme can achieve the best performance at the moderate-to-high embedding capacity compared with other state-of-the-art schemes.
AbstractList In this paper, a novel code division multiplexing (CDM) algorithm-based reversible data hiding (RDH) scheme is presented. The covert data are denoted by different orthogonal spreading sequences and embedded into the cover image. The original image can be completely recovered after the data have been extracted exactly. The Walsh Hadamard matrix is employed to generate orthogonal spreading sequences, by which the data can be overlappingly embedded without interfering each other, and multilevel data embedding can be utilized to enlarge the embedding capacity. Furthermore, most elements of different spreading sequences are mutually cancelled when they are overlappingly embedded, which maintains the image in good quality even with a high embedding payload. A location-map free method is presented in this paper to save more space for data embedding, and the overflow/underflow problem is solved by shrinking the distribution of the image histogram on both the ends. This would further improve the embedding performance. Experimental results have demonstrated that the CDM-based RDH scheme can achieve the best performance at the moderate-to-high embedding capacity compared with other state-of-the-art schemes.
Author Bin Ma
Shi, Yun Q.
Author_xml – sequence: 1
  surname: Bin Ma
  fullname: Bin Ma
  email: mab@qlu.edu.cn
  organization: Sch. of Inf. Sci., Qilu Univ. of Technol., Jinan, China
– sequence: 2
  givenname: Yun Q.
  surname: Shi
  fullname: Shi, Yun Q.
  email: shi@njit.edu
  organization: Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
BookMark eNp9kD1PwzAQhi0EEqXwAxBLJBaWFJ_t2M4I5aNIICQ-ZstxLuAqTUqcVPDvcdWKoQOTz7rnvTs9R2S_aRsk5BToBIDml28Pd68TRkFOWCYlk7BHRpBlMpWUwf5fDfyQHIUwp1QIkHpEplfJC66wC76oMbmxvU1mvvTNR_LqPnGBybUNWCZtk0zbMgJ-5YOPv6eh7v2yxu-IHpODytYBT7bvmLzf3b5NZ-nj8_3D9OoxdZzJPkWaScsKXnCGOitzqyvQDnPBmFIqqwSzjpWWSx27FF1lmbA5B2WVK4TgfEwuNnOXXfs1YOjNwgeHdW0bbIdgQLMsA84Ujej5Djpvh66J1xlQuaZcM84iBRvKdW0IHVZm2fmF7X4MULPWatZazVqr2WqNGbWTcb63fXTSd9bX_ybPNkmPiH-blJBKaOC_M3iEyA
CODEN ITIFA6
CitedBy_id crossref_primary_10_1007_s10489_021_02476_2
crossref_primary_10_32604_csse_2023_036152
crossref_primary_10_1109_TCSVT_2023_3237136
crossref_primary_10_1007_s00530_023_01253_0
crossref_primary_10_1007_s11071_023_08622_4
crossref_primary_10_1016_j_jisa_2018_01_006
crossref_primary_10_1109_TIFS_2019_2963766
crossref_primary_10_1016_j_sigpro_2020_107657
crossref_primary_10_1016_j_sigpro_2019_02_013
crossref_primary_10_1007_s00034_018_0790_z
crossref_primary_10_1109_TCSVT_2022_3153796
crossref_primary_10_1016_j_image_2021_116405
crossref_primary_10_1007_s00371_023_02778_1
crossref_primary_10_1109_TIFS_2024_3402948
crossref_primary_10_4018_IJDCF_2019100108
crossref_primary_10_1080_02564602_2020_1757521
crossref_primary_10_1016_j_eswa_2023_120237
crossref_primary_10_1155_2022_9508749
crossref_primary_10_1016_j_dsp_2021_103130
crossref_primary_10_1016_j_dsp_2023_104145
crossref_primary_10_1016_j_jvcir_2019_04_015
crossref_primary_10_1007_s11042_018_6589_x
crossref_primary_10_32604_csse_2023_036652
crossref_primary_10_1007_s11042_023_17755_y
crossref_primary_10_1109_ACCESS_2022_3218643
crossref_primary_10_1007_s11042_020_09985_1
crossref_primary_10_1016_j_jisa_2021_103106
crossref_primary_10_1109_ACCESS_2022_3212145
crossref_primary_10_1109_TCSVT_2021_3125711
crossref_primary_10_1007_s11554_019_00891_w
crossref_primary_10_1109_TCSVT_2022_3146159
crossref_primary_10_1587_transinf_2022EDP7109
crossref_primary_10_1007_s11042_020_09719_3
crossref_primary_10_1016_j_eswa_2022_118529
crossref_primary_10_1109_TCSVT_2023_3311483
crossref_primary_10_1016_j_eswa_2023_121017
crossref_primary_10_1007_s11042_022_13280_6
crossref_primary_10_1109_TCSVT_2024_3495673
crossref_primary_10_1016_j_ins_2021_09_019
crossref_primary_10_1080_09500340_2022_2138593
crossref_primary_10_1007_s00034_022_02076_6
crossref_primary_10_1109_ACCESS_2019_2903079
crossref_primary_10_1016_j_sigpro_2020_107544
crossref_primary_10_1007_s11036_023_02133_7
crossref_primary_10_1109_TCSVT_2019_2942489
crossref_primary_10_1016_j_chaos_2022_112770
crossref_primary_10_1109_ACCESS_2016_2573308
crossref_primary_10_1007_s11042_023_16753_4
crossref_primary_10_1109_ACCESS_2022_3194730
crossref_primary_10_1016_j_jvcir_2020_102932
crossref_primary_10_1088_1402_4896_ac95d9
crossref_primary_10_1109_TIFS_2018_2819122
crossref_primary_10_1109_LSP_2021_3080181
crossref_primary_10_1016_j_eswa_2023_120610
crossref_primary_10_1016_j_isatra_2021_06_019
crossref_primary_10_1007_s11042_023_15189_0
crossref_primary_10_1016_j_jksuci_2018_06_001
crossref_primary_10_1109_TIFS_2025_3544956
crossref_primary_10_1109_TPAMI_2021_3131250
crossref_primary_10_1186_s12911_020_01328_2
crossref_primary_10_1371_journal_pone_0271507
crossref_primary_10_32604_csse_2023_037281
crossref_primary_10_32604_cmc_2023_036090
crossref_primary_10_1088_1402_4896_acc5b6
crossref_primary_10_3390_s21041544
crossref_primary_10_3390_e24091266
crossref_primary_10_1109_LSP_2025_3547664
crossref_primary_10_1007_s11042_017_5462_7
crossref_primary_10_1088_1402_4896_ac0d2e
crossref_primary_10_1109_ACCESS_2020_3034936
crossref_primary_10_1109_LSP_2022_3227813
crossref_primary_10_1142_S0218127421500036
crossref_primary_10_1016_j_sigpro_2018_11_011
crossref_primary_10_1142_S0217984921504650
crossref_primary_10_1109_TCSVT_2019_2915584
crossref_primary_10_32604_cmc_2023_035668
crossref_primary_10_1007_s11554_019_00884_9
crossref_primary_10_1007_s11042_023_15354_5
crossref_primary_10_1016_j_sigpro_2022_108818
crossref_primary_10_1109_TCSVT_2021_3055612
crossref_primary_10_1016_j_jisa_2024_103957
crossref_primary_10_1016_j_sigpro_2023_108956
crossref_primary_10_3390_math11041017
crossref_primary_10_1155_2019_4732632
crossref_primary_10_1109_LSP_2022_3149706
crossref_primary_10_1145_3534565
crossref_primary_10_1155_2018_9803519
crossref_primary_10_1145_3645105
crossref_primary_10_1016_j_ins_2019_07_101
crossref_primary_10_1007_s11042_017_5498_8
crossref_primary_10_1109_TCSVT_2022_3222559
crossref_primary_10_1007_s11042_018_6486_3
crossref_primary_10_1007_s11036_023_02147_1
crossref_primary_10_1007_s11042_018_6717_7
crossref_primary_10_1109_ACCESS_2023_3275019
crossref_primary_10_1049_iet_ipr_2018_5333
crossref_primary_10_1049_iet_ipr_2019_1066
crossref_primary_10_32604_cmc_2023_038970
crossref_primary_10_1016_j_jvcir_2022_103478
crossref_primary_10_32604_csse_2021_014138
crossref_primary_10_1016_j_ins_2018_08_028
crossref_primary_10_1007_s11042_021_10894_0
crossref_primary_10_1088_1674_1056_abfa01
crossref_primary_10_1016_j_sigpro_2020_107864
crossref_primary_10_1109_ACCESS_2019_2901302
crossref_primary_10_1109_LSP_2024_3512357
crossref_primary_10_1016_j_sigpro_2019_06_025
crossref_primary_10_1007_s10851_021_01048_w
crossref_primary_10_32604_cmc_2023_039804
crossref_primary_10_1109_ACCESS_2020_3006139
crossref_primary_10_1109_TCSVT_2021_3103215
crossref_primary_10_1007_s11042_018_6446_y
crossref_primary_10_1109_TCSVT_2023_3284910
crossref_primary_10_32604_cmc_2023_035695
crossref_primary_10_1016_j_sigpro_2019_107264
Cites_doi 10.1587/elex.7.1702
10.1109/TIP.2006.891046
10.1109/TIP.2013.2257814
10.1109/TIFS.2007.905146
10.1109/TIP.2005.859373
10.1117/12.527216
10.1109/TIP.2014.2307482
10.1109/TCSVT.2003.815962
10.1109/ICME.2006.262782
10.1109/TIP.2004.840686
10.1109/TIFS.2008.924600
10.1007/11922841_26
10.1109/TIFS.2012.2224108
10.1109/TIFS.2011.2145372
10.1587/transfun.E92.A.2572
10.1109/TCSVT.2008.918761
10.1109/JSTSP.2010.2049222
10.1109/TMM.2012.2229262
10.1109/TIP.2011.2150233
10.1117/12.435400
10.1109/TCSVT.2006.881857
10.1109/83.855427
10.1117/12.473164
10.1109/TIP.2004.828418
10.1049/iet-ipr.2009.0316
10.1109/TIP.2011.2162424
10.1109/TIP.2012.2191564
10.1587/elex.5.870
10.1109/TIP.2013.2246179
10.1109/ICIP.2007.4379295
10.1007/978-3-642-40099-5_31
10.1109/TCSVT.2006.869964
10.1109/TCSVT.2009.2020257
10.1016/j.optcom.2011.09.005
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
F28
DOI 10.1109/TIFS.2016.2566261
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Civil Engineering Abstracts
Civil Engineering Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1556-6021
EndPage 1927
ExternalDocumentID 4094630861
10_1109_TIFS_2016_2566261
7467481
Genre orig-research
GrantInformation_xml – fundername: Shandong Provincial Natural Science Foundation, China
  grantid: ZR2012F014
  funderid: 10.13039/501100007129
– fundername: Jinan University and the Institutes Innovation Program
  grantid: JN201402005
  funderid: 10.13039/501100004024
– fundername: National Natural Science Foundation of China
  grantid: 41202206
  funderid: 10.13039/501100001809
GroupedDBID 0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
RIG
7SC
7SP
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
F28
ID FETCH-LOGICAL-c326t-e056a2b3b32e85d9a8f18ce94227775f42ac2da36885d0ecfa24a9317a7cb4433
IEDL.DBID RIE
ISSN 1556-6013
IngestDate Fri Jul 11 11:06:23 EDT 2025
Mon Jun 30 05:22:19 EDT 2025
Tue Jul 01 02:34:11 EDT 2025
Thu Apr 24 23:10:59 EDT 2025
Tue Aug 26 16:40:14 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords embedding capacity
prediction-error
Code division multiplexing (CDM)
reversible data hiding (RDH)
location-map free
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c326t-e056a2b3b32e85d9a8f18ce94227775f42ac2da36885d0ecfa24a9317a7cb4433
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0002-9030-7393
PQID 1798038232
PQPubID 85506
PageCount 14
ParticipantIDs proquest_miscellaneous_1825513270
proquest_journals_1798038232
ieee_primary_7467481
crossref_primary_10_1109_TIFS_2016_2566261
crossref_citationtrail_10_1109_TIFS_2016_2566261
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2016-09-01
PublicationDateYYYYMMDD 2016-09-01
PublicationDate_xml – month: 09
  year: 2016
  text: 2016-09-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information forensics and security
PublicationTitleAbbrev TIFS
PublicationYear 2016
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref35
ref13
ref34
ref12
ref15
ref14
ref31
ni (ref23) 2006; 16
ref30
ref33
ref11
ref32
ref10
ref2
ref16
ref19
ref18
barton (ref1) 1997
ref24
li (ref17) 2011; 20
ref26
ref25
ref20
ref22
ref21
ref28
ref27
viterbi (ref36) 1995
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref19
  doi: 10.1587/elex.7.1702
– ident: ref10
  doi: 10.1109/TIP.2006.891046
– ident: ref5
  doi: 10.1109/TIP.2013.2257814
– ident: ref34
  doi: 10.1109/TIFS.2007.905146
– ident: ref8
  doi: 10.1109/TIP.2005.859373
– ident: ref32
  doi: 10.1117/12.527216
– ident: ref22
  doi: 10.1109/TIP.2014.2307482
– ident: ref6
  doi: 10.1109/TCSVT.2003.815962
– ident: ref25
  doi: 10.1109/ICME.2006.262782
– ident: ref3
  doi: 10.1109/TIP.2004.840686
– ident: ref9
  doi: 10.1109/TIFS.2008.924600
– ident: ref31
  doi: 10.1007/11922841_26
– ident: ref30
  doi: 10.1109/TIFS.2012.2224108
– ident: ref13
  doi: 10.1109/TIFS.2011.2145372
– ident: ref18
  doi: 10.1587/transfun.E92.A.2572
– ident: ref24
  doi: 10.1109/TCSVT.2008.918761
– ident: ref16
  doi: 10.1109/JSTSP.2010.2049222
– ident: ref20
  doi: 10.1109/TMM.2012.2229262
– volume: 20
  start-page: 3524
  year: 2011
  ident: ref17
  article-title: Efficient reversible watermarking based on adaptive prediction-error expansion and pixel selection
  publication-title: IEEE Trans Image Process
  doi: 10.1109/TIP.2011.2150233
– ident: ref2
  doi: 10.1117/12.435400
– ident: ref33
  doi: 10.1109/TCSVT.2006.881857
– ident: ref11
  doi: 10.1109/83.855427
– ident: ref4
  doi: 10.1117/12.473164
– ident: ref7
  doi: 10.1109/TIP.2004.828418
– ident: ref27
  doi: 10.1049/iet-ipr.2009.0316
– ident: ref21
  doi: 10.1109/TIP.2011.2162424
– ident: ref35
  doi: 10.1109/TIP.2012.2191564
– ident: ref12
  doi: 10.1587/elex.5.870
– ident: ref29
  doi: 10.1109/TIP.2013.2246179
– ident: ref14
  doi: 10.1109/ICIP.2007.4379295
– ident: ref28
  doi: 10.1007/978-3-642-40099-5_31
– volume: 16
  start-page: 354
  year: 2006
  ident: ref23
  article-title: Reversible data hiding
  publication-title: IEEE Trans Circuits Syst Video Technol
  doi: 10.1109/TCSVT.2006.869964
– ident: ref15
  doi: 10.1109/TCSVT.2009.2020257
– start-page: 112
  year: 1995
  ident: ref36
  publication-title: CDMA Principles of Spread Spectrum Communication
– year: 1997
  ident: ref1
  article-title: Method and apparatus for embedding authentication information within digital data
– ident: ref26
  doi: 10.1016/j.optcom.2011.09.005
SSID ssj0044168
Score 2.5180314
Snippet In this paper, a novel code division multiplexing (CDM) algorithm-based reversible data hiding (RDH) scheme is presented. The covert data are denoted by...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1914
SubjectTerms Algorithm design and analysis
Authentication
Code division multiplexing
Code division multiplexing (CDM)
Computer information security
Data mining
Distortion
embedding capacity
Histograms
Image coding
Information dissemination
location-map free
Multilevel
Payloads
prediction-error
reversible data hiding (RDH)
Spreading
State of the art
Title A Reversible Data Hiding Scheme Based on Code Division Multiplexing
URI https://ieeexplore.ieee.org/document/7467481
https://www.proquest.com/docview/1798038232
https://www.proquest.com/docview/1825513270
Volume 11
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3dT9swED8VnsYD5VN0A-RJe5pISRM7sR-hW1UmlQcGEm-RnVxERZdMI5XQ_nrOjlOND028RfI5iXw-3_18XwBfCPQIw-M0UNLeVhlVBpIXJkidMtChkMZV-7xMpjf8x6247cHJKhcGEV3wGQ7to_PlF3W-tFdlp21rDMI6awTc2lyt7tQlrd6mvQmRBAQyYu_BHIXq9Ppi8tMGcSVD0u9kwI-e6SDXVOXVSezUy6QPs-7H2qiS--GyMcP874uaje_98y3Y9HYmO2s3xjb0sNqBftfDgXmR3oGNfwoS7sL4jF2hC9QwC2TfdKPZdG61G024w1_IzknpFayu2LguiGDepqazmQ9LfCTSPbiZfL8eTwPfZiHIyXZrAiQbSEcmNnGEUhRKy3Ikc1Q8itI0FSWPdB4VOk4kjYaYlzriWpHdodPccB7H-7Be1RUeAEvSkgARNyNhFFeykBy1KkjQURiRKD6AsFv4LPc1yG0rjEXmsEioMsurzPIq87wawNfVlN9tAY7_Ee_atV8R-mUfwGHH3cyL6ENmK7WF1gsaDeDzapiEy3pMdIX1kmgIPwvC62n48e03f4IP9vtt0NkhrDd_lnhEVkpjjt32fALiHN_m
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB4hOLQ9AIVWXR6tK_VUNUsedmIfYdvV0rIcYJG4RXYyURGQIMhKiF_P2HFW0KKqt0geR5bH42_G8wL4QkaPMDzJAiXta5VRVSB5aYLMgYEOhTSu2udxOjnjP8_F-RJ8W-TCIKILPsOh_XS-_LIp5vapbK9rjUG2zgrhvoi6bK3-3iVc7xLfhEgDMjMS78OMQrU3Oxyf2jCudEgITyp89AyFXFuVv-5iBzDjNZj2S-viSi6H89YMi4c_qjb-79rXYdVrmmy_OxpvYQnrDVjruzgwL9Qb8OZJScJNGO2zE3ShGuYK2Xfdaja5sPhGE37jNbIDgr2SNTUbNSURXHTJ6WzqAxPvifQdnI1_zEaTwDdaCArS3toASQvSsUlMEqMUpdKyimSBisdxlmWi4rEu4lInqaTREItKx1wr0jx0VhjOk-Q9LNdNjR-ApVlFJhE3kTCKK1lKjlqVJOoojEgVH0DYb3xe-CrkthnGVe6skVDllle55VXueTWAr4spN10Jjn8Rb9q9XxD6bR_ATs_d3AvpXW5rtYXWDxoP4PNimMTL-kx0jc2caMiCFmSxZ-HWy3_-BK8ms-lRfnR4_GsbXtu1dCFoO7Dc3s5xl3SW1nx0R_URug3jLw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Reversible+Data+Hiding+Scheme+Based+on+Code+Division+Multiplexing&rft.jtitle=IEEE+transactions+on+information+forensics+and+security&rft.au=Ma%2C+Bin&rft.au=Shi%2C+Yun+Q.&rft.date=2016-09-01&rft.issn=1556-6013&rft.eissn=1556-6021&rft.volume=11&rft.issue=9&rft.spage=1914&rft.epage=1927&rft_id=info:doi/10.1109%2FTIFS.2016.2566261&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIFS_2016_2566261
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1556-6013&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1556-6013&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1556-6013&client=summon