Regular Section
Further Results on the Separating Redundancy of Binary Linear Codes
2019 年 E102.A 巻 10 号 p. 1420-1425
詳細
2019 年 E102.A 巻 10 号 p. 1420-1425
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.
