Constructing good covering codes for applications in steganography

Jürgen Bierbrauer; Jessica Fridrich

doi:10.1007/978-3-540-69019-1_1

Constructing good covering codes for applications in steganography

Jürgen Bierbrauer
, Jessica Fridrich

Electrical and Computer Eng

Binghamton University

Michigan Technological University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

75 Scopus citations

Abstract

Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes constructed using the blockwise direct sum of factorizations. We show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers. Implementation details are given for a selected code family.

Original language	English
Title of host publication	Transactions on Data Hiding and Multimedia Security III
Editors	Yun Q. Shi
Pages	1-22
Number of pages	22
DOIs	https://doi.org/10.1007/978-3-540-69019-1_1
State	Published - 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4920 LNCS

Access to Document

10.1007/978-3-540-69019-1_1

Cite this

Bierbrauer, J., & Fridrich, J. (2008). Constructing good covering codes for applications in steganography. In Y. Q. Shi (Ed.), Transactions on Data Hiding and Multimedia Security III (pp. 1-22). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4920 LNCS). https://doi.org/10.1007/978-3-540-69019-1_1

@inproceedings{6c8d4310742942359d933ddcdadaa560,

title = "Constructing good covering codes for applications in steganography",

abstract = "Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes constructed using the blockwise direct sum of factorizations. We show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers. Implementation details are given for a selected code family.",

author = "J{\"u}rgen Bierbrauer and Jessica Fridrich",

year = "2008",

doi = "10.1007/978-3-540-69019-1\_1",

language = "English",

isbn = "3540690166",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1--22",

editor = "Shi, \{Yun Q.\}",

booktitle = "Transactions on Data Hiding and Multimedia Security III",

}

Bierbrauer, J & Fridrich, J 2008, Constructing good covering codes for applications in steganography. in YQ Shi (ed.), Transactions on Data Hiding and Multimedia Security III. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4920 LNCS, pp. 1-22. https://doi.org/10.1007/978-3-540-69019-1_1

Constructing good covering codes for applications in steganography. / Bierbrauer, Jürgen; Fridrich, Jessica.
Transactions on Data Hiding and Multimedia Security III. ed. / Yun Q. Shi. 2008. p. 1-22 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4920 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Constructing good covering codes for applications in steganography

AU - Bierbrauer, Jürgen

AU - Fridrich, Jessica

PY - 2008

Y1 - 2008

N2 - Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes constructed using the blockwise direct sum of factorizations. We show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers. Implementation details are given for a selected code family.

AB - Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes constructed using the blockwise direct sum of factorizations. We show that non-linear constructions offer better performance compared to simple linear covering codes currently used by steganographers. Implementation details are given for a selected code family.

UR - https://www.scopus.com/pages/publications/45449087266

U2 - 10.1007/978-3-540-69019-1_1

DO - 10.1007/978-3-540-69019-1_1

M3 - Conference contribution

SN - 3540690166

SN - 9783540690160

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 22

BT - Transactions on Data Hiding and Multimedia Security III

A2 - Shi, Yun Q.

ER -

Constructing good covering codes for applications in steganography

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this