Abstract
By using the finite projective geometry method, the separating properties of linear constant-weight codes are presented. An algorithm is given for computing the cardinality of separating coordinate positions of certain disjoint codeword sets of linear constant-weight codes.
Original language | English |
---|---|
Pages (from-to) | 263-272 |
Number of pages | 10 |
Journal | Bulletin of the Korean Mathematical Society |
Volume | 53 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2016 |
Keywords
- Disjoint codeword sets
- Feasible set
- Intersection number
- Separating property
- Value as-signment