Munuera, 2013 - Google Patents
Steganography from a coding theory point of viewMunuera, 2013
View PDF- Document ID
- 16263374682759684511
- Author
- Munuera C
- Publication year
- Publication venue
- Algebraic geometry modeling in information theory
External Links
Snippet
Steganography is the science of invisible communications. It is a very old method that, thanks to recent progress, has begun to play an important role as an alternative and as a complement of Cryptography. This Chapter presents an introduction to the objectives, the …
- 230000000295 complement 0 abstract description 2
Classifications
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/001—Modulated-carrier systems using chaotic signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/41—Bandwidth or redundancy reduction
- H04N1/411—Bandwidth or redundancy reduction for the transmission or storage or reproduction of two-tone pictures, e.g. black and white pictures
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Filler et al. | Minimizing additive distortion in steganography using syndrome-trellis codes | |
Abbe et al. | Polar codes for the $ m $-user multiple access channel | |
Wang et al. | Perfectly secure steganography: Capacity, error exponents, and code constructions | |
Chan et al. | Private information retrieval for coded storage | |
Munuera | Steganography and error-correcting codes | |
Hall | Notes on coding theory | |
Alajaji et al. | An introduction to single-user information theory | |
Wang et al. | Steganalysis of block-structured stegotext | |
Kim et al. | Data hiding based on overlapped pixels using hamming code | |
Bao et al. | A robust image steganography on resisting JPEG compression with no side information | |
Moulin et al. | New results on steganographic capacity | |
Munuera | Steganography from a coding theory point of view | |
Christ et al. | Pseudorandom error-correcting codes | |
Lefèvre et al. | Application of rank metric codes in digital image watermarking | |
Fontaine et al. | How Reed-Solomon codes can improve steganographic schemes | |
Rifà-Pous et al. | Product perfect codes and steganography | |
Zhang et al. | A coding problem in steganography | |
Moulin et al. | A framework for the design of good watermark identification codes | |
Chow et al. | Covert QR codes: How to hide in the crowd | |
Justesen et al. | Two-Dimensional Information Theory and Coding: With Applications to Graphics Data and High-Density Storage Media | |
Agarwal et al. | Coding into a source: A direct inverse rate-distortion theorem | |
Fridrich et al. | Steganography via codes for memory with defective cells | |
Fontaine et al. | How can Reed-Solomon codes improve steganographic schemes? | |
Munuera et al. | Wet paper codes and the dual distance in steganography | |
Fernandez et al. | Multimedia Fingerprinting Codes Resistant to Linear Attacks and Adversarial Noise |