The separation of binary relative three-weight codes and its applications
发布时间:2025-03-31
点击次数:
- DOI码:
- 10.1007/s12095-018-0339-9
- 发表刊物:
- Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences
- 关键字:
- Separating property7, Relative constant-weight code,Minimal codewords,Trellis complexity
- 摘要:
- The separation and its applications of binary relative three-weight codes are studied. We first present a certain formula for computing the minimum values of the cardinality of separating coordinate position (CSCP) of some codeword sets for any binary linear code, and then with the above formula, we calculate all the minimum values of the CSCP of binary relative three-weight codes so as to determine their separation. By using the obtained separation of binary relative three-weight codes, some new binary separating codes are constructed. Based on a family of the minimum values of the CSCP of binary relative three-weight codes, we also determine all the minimal codewords and the trellis complexity of binary relative three-weight codes.
- 合写作者:
- Zihui Liu, Yiwei Liu
- 第一作者:
- Ying Gao
- 论文类型:
- 期刊论文
- 通讯作者:
- Zihui Liu
- 卷号:
- 11
- 期号:
- 5
- 页面范围:
- 979–992
- ISSN号:
- 1936-2447
- 是否译文:
- 否
- 发表时间:
- 2019-11-14