Bounds and constructions for 3-separable codes with length 3

DOI10.1007/S10623-015-0160-9MaRDI QIDQ306344zbMATH OpenOpenAlexFDO

Authors Minquan Cheng, Jing Jiang, Ying Miao, Xiaohu Tang, Haiyan 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

multimedia fingerprintingpartial Latin squareseparable codeperfect hash familySteiner triple system

Mathematics Subject Classification ID

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

Abstract: Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let $mathcalC$ be a code of length $n$ over an alphabet of $q$ letters. The descendant code $sfdesc(mathcal{C}_0)$ of $$ is defined to be the set of words $$ such that $x_{i}in{c}_{1,i},c_{2,i},ldots,c_{t,i}$ for all $i=1,ldots,n$, where $$. $mathcalC$ is a $overlinet$-separable code if for any two distinct $mathcal{C}_1,mathcal{C}_{2}subseteqmathcalC$ with $|mathcal{C}_1|let$, $|mathcal{C}_2|let$, we always have $sfdesc(mathcal{C}_1)eqsfdesc(mathcal{C}_2)$. Let $M(overlinet,n,q)$ denote the maximal possible size of such a separable code. In this paper, an upper bound on $M(overline3,3,q)$ is derived by considering an optimization problem related to a partial Latin square, and then two constructions for $overline3$-SC$(3,M,q)$s are provided by means of perfect hash families and Steiner triple systems.

Recommendations

• New bounds on \(\bar{2}\)-separable codes of length 2
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• \(\overline{2}\)-separable codes with length 5
• LATIN 2004: Theoretical Informatics
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4

Cites work

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

Cited in

(4)

• \(\overline{2}\)-separable codes with length 5
• A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• New bounds on \(\bar{2}\)-separable codes of length 2

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

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