Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting

DOI10.1109/TIT.2020.3033445zbMATH Open1465.94027arXiv1905.10180OpenAlexW3098847492MaRDI QIDQ5151702FDOQ5151702

Authors: Jin-ping Fan, Yujie Gu, Masahiro Hachimori, Ying Miao 

Publication date: 22 February 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: In this paper, we study the signature codes for weighted binary adder channel (WbAC) and collusion-resistant multimedia fingerprinting. Let $A(n,t)$ denote the maximum cardinality of a $t$-signature code of length $n$, and $A(n,w,t)$ denote the maximum cardinality of a $t$-signature code of length $n$ and constant weight $w$. First, we derive asymptotic and general upper bounds of $A(n,t)$ by relating signature codes to $B_t$ codes and bipartite graphs with large girth respectively, and also show the upper bounds are tight for certain cases. Second, we determine the exact values of $A(n,2,2)$ and $A(n,3,2)$ for infinitely many $n$ by connecting signature codes with $C_4$-free graphs and union-free families, respectively. Third, we provide two explicit constructions for $t$-signature codes which have efficient decoding algorithms and applications to two-level signature codes. Furthermore, we show from the geometric viewpoint that there does not exist any binary code with complete traceability for noisy WbAC and multimedia fingerprinting. A new type of signature codes with a weaker requirement than complete traceability is introduced for the noisy scenario.

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

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14)

Cited In (8)

• Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
• Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
• Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
• Comparison of signature file models with superimposed coding
• Separable collusion-secure multimedia codes
• Signature codes for noisy multiple access adder channel

This page was built for publication: Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting

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