%0 Conference Proceedings
%T Relationship between Correcting Code and Module Technique in Hiding Secret Data
%+ Hanoi University of Science and Technology (HUST)
%+ Ministry of Education and Training [Hanoi]
%+ Sejong University
%A Huy, Phan, Trung
%A Thanh, Nguyen, Hai
%A Kim, Cheonsick
%Z Part 8: Web, Communication, and Cloud Computing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th International Conference on Network and Parallel Computing (NPC)
%C Gwangju, South Korea
%Y James J. Park
%Y Albert Zomaya
%Y Sang-Soo Yeo
%Y Sartaj Sahni
%I Springer
%3 Network and Parallel Computing
%V LNCS-7513
%P 297-307
%8 2012-09-06
%D 2012
%R 10.1007/978-3-642-35606-3_35
%K module
%K ring
%K characteristic 2
%K data hiding
%K binary image
%K steganography
%K correcting codes
%K covering function
%K MSDR
%Z Computer Science [cs]Conference papers
%X In this paper, we show the role of modules over rings of finite characteristics in data hiding area. Applications of correcting codes and covering functions in data hiding are shown as special cases of our module approach. Applications of modules over rings of characteristic 2 to design new embedding schemes for hiding secret data in binary images are introduced.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01551381/document
%2 https://inria.hal.science/hal-01551381/file/978-3-642-35606-3_35_Chapter.pdf
%L hal-01551381
%U https://inria.hal.science/hal-01551381
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-7513