IEICE Trans - Further Results on the Separating Redundancy of Binary Linear Codes

Further Results on the Separating Redundancy of Binary Linear Codes

Haiyang LIU  Lianrong MA

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A    No.10    pp.1420-1425
Publication Date: 2019/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.1420
Type of Manuscript: LETTER
Category: Coding Theory
Keyword:
separating matrix,  separating redundancy,  binary linear codes,  cycle codes,

Full Text: PDF>>

Summary:
In this letter, we investigate the separating redundancy of binary linear codes. Using analytical techniques, we provide a general lower bound on the first separating redundancy of binary linear codes and show the bound is tight for a particular family of binary linear codes, i.e., cycle codes. In other words, the first separating redundancy of cycle codes can be determined. We also derive a deterministic and constructive upper bound on the second separating redundancy of cycle codes, which is shown to be better than the general deterministic and constructive upper bounds for the codes.