Release time:2025-03-31

Hits:

DOI number:10.1007/s12095-018-0339-9

Journal:Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences

Key Words:Separating property7, Relative constant-weight code,Minimal codewords,Trellis complexity

Abstract: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.

Co-author:Zihui Liu, Yiwei Liu

First Author:Ying Gao

Indexed by:Journal paper

Correspondence Author:Zihui Liu

Volume:11

Issue:5

Page Number:979–992

ISSN No.:1936-2447

Translation or Not:no

Date of Publication:2019-11-14