Improving success probability and embedding efficiency in code based steganography

TL;DR

This paper introduces a method using punctured codes to improve the success probability and embedding efficiency of code-based steganography schemes, addressing decoding limitations.

Contribution

It proposes a novel approach employing punctured codes to enhance embedding success and efficiency in steganography based on error correcting codes.

Findings

Punctured codes can significantly increase embedding success probability.

The method improves embedding efficiency in code-based steganography.

The approach offers a practical solution to decoding failure issues.

Abstract

For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail. We propose a method to ensure or increase the probability of embedding success for these stegoschemes. This method is based on puncturing codes. We show how the use of punctured codes may also increase the embedding efficiency of the obtained stegoschemes.