Codes for copyright protection: The case of two pirates

被引：5
|
作者：
Kabatiansky G.A. [1 ]
机构：
[1] Institute for Information Transmission Problems, RAS, Moscow
来源：
Problems of Information Transmission | 2005年 / 41卷 / 2期
基金：
俄罗斯基础研究基金会;
关键词：
System Theory; Minimum Distance; Copyright Protection; Distance Decode;
D O I：
10.1007/s11122-005-0022-6
中图分类号：
学科分类号：
摘要：
The problem of finding so-called pirates via the minimum Hamming distance decoding is considered for the simplest case of two pirates. We prove that for all q ≥ 3 there exist "good" q-ary codes capable of finding at least one pirate by the minimum distance decoding in the Hamming metric. © 2005 Pleiades Publishing, Inc.
引用
收藏
页码：182 / 186
页数：4
相关论文
共 50 条
12345