Correspondence between steganographic protocols and error correcting codes

MaRDI QIDQ5241152zbMATH OpenFDO

Authors Mohamed Bouye, M'Hammed Boulagouaz

Publication date 30 October 2019

zbMATH Keywords

BCH codecovering radiusHamming distancelinear correcting codeparity matrixsteganographic protocol

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Steganography and error-correcting codes
• Coverings, centered codes, and combinatorial steganography
• The properties and constructions of linear steganographic codes
• A coding problem in steganography
• Code based cryptography and steganography

Cites work

• All binary 3-error-correcting BCH codes of length<tex>2^m-i</tex>have covering radius 5 (Corresp.)
• Complete decoding of triple-error-correcting binary BCH codes
• scientific article; zbMATH DE number 1894623 (Why is no real title available?)
• Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)
• Steganography and error-correcting codes

Cited in

(4)

• Wet paper codes and the dual distance in steganography
• Fast BCH Syndrome Coding for Steganography
• A Shared Steganographic File System with Error Correction
• Steganography and error-correcting codes

This page was built for publication: Correspondence between steganographic protocols and error correcting codes

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