Correspondence between steganographic protocols and error correcting codes

zbMATH Open1423.94141MaRDI QIDQ5241152FDOQ5241152

M'Hammed Boulagouaz, Mohamed Bouye

Publication date: 30 October 2019

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

zbMATH Keywords

Hamming distancecovering radiusBCH codeparity matrixlinear correcting codesteganographic 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)

Cites Work

• Title not available (Why is that?)
• Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)
• Complete decoding of triple-error-correcting binary BCH codes
• All binary 3-error-correcting BCH codes of length<tex>2^m-i</tex>have covering radius 5 (Corresp.)
• Steganography and error-correcting codes

Cited In (4)

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

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)