Abstract
For a binary linear code, a new relation between the intersection and (2, 2)-separating property is addressed, and a relation between the intersection and the trellis complexity is also given. Using above relations, the authors will apply several classes of binary codes to secret sharing scheme and determine their trellis complexity and separating properties. The authors also present the properties of the intersection of certain kinds of two-weight binary codes. By using the concept of value function, the intersecting properties of general binary codes are described.
| Original language | English |
|---|---|
| Pages (from-to) | 814-824 |
| Number of pages | 11 |
| Journal | Journal of Systems Science and Complexity |
| Volume | 29 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jun 2016 |
Keywords
- Minimal access structure
- minimal codeword
- separating property
- trellis complexity
- twoweight code
- value function