首页> 外文会议>Applied Algebra, Algebraic Algorithms and Error-Correcting Codes >Partially Identifying Codes for Copyright Protection
【24h】

Partially Identifying Codes for Copyright Protection

机译:部分识别版权保护的代码

获取原文

摘要

If Γ is a q-axy code of length n and a,b,...,e are codewords, then c is called a descendant of a,b,...,e if c_i ∈ {a_i,b_i, ...,e_i} for i = 1,...,n. Codes Γ with the property that coalitions of a limited size have restrictions on their descendants are studied. Namely, we consider codes with the following partial identification property, referred to later as 2- secure frameproof codes (2-SFPC): any two non intersecting coalitions of size at most 2 have no common descendant.
机译:如果Γ是长度为n的q轴码,而a,b,...,e是码字,则如果c_i∈{a_i,b_i,..,则c称为a,b,...,e的后代。 。,e_i} for i = 1,...,n。研究具有有限规模的联盟对其后代具有限制的性质的代码Γ。即,我们考虑具有以下部分标识属性的代码,以后称为2-安全帧验证代码(2-SFPC):大小不超过2的任意两个不相交的联盟没有公共后代。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号