✦ LIBER ✦

Coverings, centered codes, and combinatorial steganography

✍ Scribed by F. Galand; G. A. Kabatiansky

Book ID: 110179827
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 344 KB
Volume: 45
Category: Article
ISSN: 0032-9460
DOI: 10.1134/s0032946009030107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving Embedding Efficiency of Coveri

Improving Embedding Efficiency of Covering Codes for Applications in Steganography

✍ Weiming Zhang; Shuozhong Wang; Xinpeng Zhang 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 81 KB

q-Coverings, codes, and line graphs

✍ Peter Hammond 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Combinatorial designs and perfect codes

✍ Kevin T. Phelps 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Application of cover-free codes and comb

Application of cover-free codes and combinatorial designs to two-stage testing

✍ T. Berger; V. Levenshtein 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Combinatorial coverings from geometries

Combinatorial coverings from geometries over principal ideal rings

✍ Yeow Meng Chee; San Ling 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

A t-(v, k, λ) covering is an incidence structure with v points, each block incident on exactly k points, such that every set of t distinct points is incident on at least λ blocks. By considering certain geometries over finite principal ideal rings, we construct infinite families of t- (v, k, λ) cov

Perfectly Secure Steganography: Capacity

Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

✍ Ying Wang; Moulin, P. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 464 KB