New Lower Bounds on the Rates of Locally Thin Families and Weak Disjunctive Codes

Key Points

• The research aims to establish new lower bounds for the rates of locally thin families and weak disjunctive codes.
• Utilized probabilistic methods to derive lower bounds.
• Analyzed the rates of weak disjunctive codes under specific conditions.
• Compared findings to multimedia codes affected by averaging and noise attacks.
• Obtained new lower bounds on the rates for locally thin families and weak disjunctive codes.
• Established relationships between weak disjunctive codes and multimedia codes under attack conditions.