Intersecting codes and separating codes
| Autor: | G. Cohnen, Sylvia B. Encheva, S. Litsyn, Hans Georg Schaathun |
|---|---|
| Jazyk: | angličtina |
| Předmět: |
Discrete mathematics
Intersecting code Property (philosophy) business.industry Applied Mathematics Separating code TheoryofComputation_GENERAL Cryptography Descendant Information theory Upper and lower bounds Linear code Group code Discrete Mathematics and Combinatorics business Algorithm Copyright protection Mathematics |
| Zdroj: | Discrete Applied Mathematics. (1):75-83 |
| ISSN: | 0166-218X |
| DOI: | 10.1016/S0166-218X(02)00437-7 |
| Popis: | Let Γ be a code of length n. Then x is called a descendant of the coalition of codewords a, b,...,e if xi ∈ {ai, bi,..., ei} 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|