Abstract
Recently, three visual cryptography schemes with t -error-correcting capability (VCSs- t EC) were introduced for preventing the shadows carrying additional information from being corrupted by noise interference. However, the concerns on VCS- t EC, such as the average amount of carrying information, decoding of information from shadows, and the demonstration way of a secret, should be considered and improved. In this paper, two schemes, namely the ( k , n ) probabilistic VCS- t EC (PVCS- t EC) and the (2, n ) deterministic VCS- t EC (DVCS- t EC), are proposed. The concept of probabilistic VCS is combined with the Bose-Chaudhuri-Hocquenghem code (BCH code) for designing the ( k , n ) PVCS- t EC. Further, some constant-weight BCH codewords are adopted to build the (2, n )-DVCS- t EC. Comprehensive results and experiments are demonstrated to clarify the enhancement of information-carrying and decoding by the two proposed methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: ACM Transactions on Multimedia Computing, Communications, and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
