The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Matrix Embedding for Large Payloads
Abstract
Matrix embedding is a previously introduced coding method that is used in steganography to improve the embedding efficiency (increase the number of bits embedded per embedding change). Higher embedding efficiency translates into better steganographic security. This gain is more important for long messages than for shorter ones because longer messages are, in general, easier to detect. In this paper, we present two new approaches to matrix embedding for large payloads suitable for practical steganographic schemes-one based on a family of codes constructed from simplex codes and the second one based on random linear codes of small dimension. The embedding efficiency of the proposed methods is evaluated with respect to theoretically achievable bounds
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
New blind steganalysis and its implications
Goljan, M., Fridrich, J., & Holotyak, T. (2006) · SPIE Proceedings · doi:10.1117/12.643254 · Cited by 265
Self-citation
Cited by
Digital Watermarking and Steganography
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-372585-1.x5001-3 · Cited by 1,656
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
Filler, T., Judas, J., & Fridrich, J. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2134094 · Cited by 966
Self-citationSteganography in digital media: principles, algorithms, and applications
(2010) · Choice Reviews Online · doi:10.5860/choice.47-6907 · Cited by 546
A Capacity Result for Batch Steganography
Ker, A. D. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2006.891319 · Cited by 113
Metadata
- Authors
- Fridrich, J., & Soukal, D.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2006-09
- Volume
- 1
- Issue
- 3
- Pages
- 390-395
- ISSN
- 1556-6013 (ISSN-L)
- OpenAlex
- W2148808559
- Cited by
- 278
- References
- 2
- FWCI
- 20.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.