Intersecting codes and separating codes

被引：10

作者：

Cohnen, G

Encheva, S

Litsyn, S

Schaathun, HG

机构：

[1] Stordl Haugesund Coll, N-5528 Haugesund, Norway

[2] Ecole Natl Super Telecommun Bretagne, F-75634 Paris, France

[3] Tel Aviv Univ, EES Dept, IL-69978 Tel Aviv, Israel

[4] Univ Bergen, HIB, Dept Informat, N-5020 Bergen, Norway

来源：

DISCRETE APPLIED MATHEMATICS | 2003年 / 128卷 / 01期

关键词：

intersecting code; separating code; copyright protection;

D O I：

10.1016/S0166-218X(02)00437-7

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let Gamma be a code of length n. Then x is called a descendant of the coalition of codewords a, b,..., e if x(i) is an element of {a(i), b(i),..., e(i)} for i = 1,..., n. We study codes with the following property: any two non-intersecting coalitions of a limited size have no common descendant. We present constructions based on linear intersecting codes. (C) 2003 Elsevier Science B.V. All rights reserved.

引用

下载

页码：75 / 83

页数：9

共 50 条

[21] Separating codes and traffic monitoring
Bellitto, Thomas
THEORETICAL COMPUTER SCIENCE, 2018, 717 : 73 - 85
[22] Separating codes: Constructions and bounds
Cohen, G
Schaathun, HG
LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 322 - 328
[23] Combinatorial constructions of separating codes
Fernández, Marcel
Livieratos, John
Martín, Sebastià
Journal of Complexity, 2025, 86
[24] Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
Tsunoda, Yu
Fujiwara, Yuichiro
Ando, Hana
Vandendriessche, Peter
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (12) : 7577 - 7593
[25] Algorithmic Aspects on the Construction of Separating Codes
Fernandez, Marcel
Livieratos, John
ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 513 - 526
[26] On the Separating Redundancy of Ternary Golay Codes
Liu, Haiyang
Ma, Lianrong
Zhang, Hao
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2021, E104A (03) : 650 - 655
[27] Separating Redundancy of Linear MDS Codes
Abdel-Ghaffar, Khaled A. S.
Weber, Jos H.
2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1894 - +
[28] New upper bounds on separating codes
Cohen, G
Schaathun, HG
ICT'2003: 10TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, VOLS I AND II, CONFERENCE PROCEEDINGS, 2003, : 1290 - 1293
[29] On the Separating Redundancy of Extended Hamming Codes
Liu, Haiyang
Kim, Daeyeoul
Li, Yan
Jia, Aaron Z.
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2406 - 2410
[30] A subclass of LRC codes with intersecting recovering sets
Rajput, Charul
Bhaintwal, Maheshanand
2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 512 - 516

← 1 2 3 4 5 →