Bounds and constructions for \(\overline{3}\)-separable codes with length 3

DOI10.1007/s10623-015-0160-9zbMath1405.94131arXiv1507.00954OpenAlexW797288208MaRDI QIDQ306344

Xiaohu Tang, Ying Miao, Minquan Cheng, Jing Jiang, Hai-yan Li

Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.00954

zbMATH Keywords

Steiner triple systemperfect hash familypartial Latin squaremultimedia fingerprintingseparable code

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Related Items (1)

Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3

Cites Work

• Improved bounds for separating hash families
• New bounds on \(\bar{2}\)-separable codes of length 2
• On codes with the identifiable parent property
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Perfect hash families: Probabilistic methods and explicit constructions
• On generalized separating hash families
• Cyclotomy and difference families in elementary Abelian groups
• Probabilistic Existence Results for Separable Codes
• Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Collusion-secure fingerprinting for digital data
• Separable Codes
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• Anti-collusion fingerprinting for multimedia

This page was built for publication: Bounds and constructions for \(\overline{3}\)-separable codes with length 3