On gossip codes and traceability schemes
Ravi Sankar Veerubhotla, Ashutosh Saxena, V.P. Gulati, Pujari AK · 2004
This work presents a new construction technique for q-ary gossip codes from traceability schemes and vice versa. We demonstrate that these IPP codes, constructed by us, achieve the minimum possible code length specified for gossip codes. Further, we show that these codes can withstand erasures in digital fingerprinting applications and come up with a deterministic tracing algorithm. We also provide construction and analysis for concatenated codes derived from gossip codes.