Ensuring Message Embedding in Wet Paper Steganography (Q3104699): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Krylov Spaces over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information-theoretic model for steganography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Writing on wet paper / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings, centered codes, and combinatorial steganography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the covering radius of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wet paper codes and the dual distance in steganography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast BCH Syndrome Coding for Steganography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Codes for Information Embedding in Gray-Scale Signals / rank
 
Normal rank

Latest revision as of 18:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Ensuring Message Embedding in Wet Paper Steganography
scientific article

    Statements

    Ensuring Message Embedding in Wet Paper Steganography (English)
    0 references
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    0 references
    steganography
    0 references
    syndrome coding problem
    0 references
    wet paper codes
    0 references
    0 references
    0 references