Partial covering arrays for data hiding and quantization

DOI10.17377/SEMI.2018.15.045MaRDI QIDQ1669914zbMATH OpenOpenAlexFDO

Authors Vladimir N. Potapov

Publication date 4 September 2018

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.09287

zbMATH Keywords

quantizationlinear codedata hidingcovering arraywiretap channelwet paper stegoscheme

Mathematics Subject Classification ID

Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Linear codes (general theory) (94B05)

Abstract: We consider the problem of finding a set (partial covering array) $S$ of vertices of the Boolean $n$-cube having cardinality $2^{n-k}$ and intersecting with maximum number of $k$-dimensional faces. We prove that the ratio between the numbers of the $k$-faces containing elements of $S$ to $k$-faces is less than $1-frac1+o(1)sqrt2pik$ as $nightarrowinfty$ for sufficiently large $k$. The solution of the problem in the class of linear codes is found. Connections between this problem, cryptography and an efficiency of quantization are discussed.

Recommendations

• Improving Various Reversible Data Hiding Schemes Via Optimal Codes for Binary Covers
• An overview of scalar quantization based data hiding methods
• Partial garbling schemes and their applications
• Coverings, centered codes, and combinatorial steganography

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A survey of binary covering arrays
• Hamming codes for wet paper steganography
• On the relative profiles of a linear code and a subcode
• Problems and algorithms for covering arrays
• Wire-Tap Channel II

This page was built for publication: Partial covering arrays for data hiding and quantization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1669914)