IEICE TRANSACTIONS on Fundamentals
Further Results on the Separating Redundancy of Binary Linear Codes
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.10 pp.1420-1425
- Publication Date
- 2019/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.1420
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Haiyang LIU
the Institute of Microelectronics of Chinese Academy of Sciences
Lianrong MA
Tsinghua University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Haiyang LIU, Lianrong MA, "Further Results on the Separating Redundancy of Binary Linear Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 10, pp. 1420-1425, October 2019, doi: 10.1587/transfun.E102.A.1420.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1420/_p
Copy
@ARTICLE{e102-a_10_1420,
author={Haiyang LIU, Lianrong MA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Further Results on the Separating Redundancy of Binary Linear Codes},
year={2019},
volume={E102-A},
number={10},
pages={1420-1425},
abstract={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.},
keywords={},
doi={10.1587/transfun.E102.A.1420},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Further Results on the Separating Redundancy of Binary Linear Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1420
EP - 1425
AU - Haiyang LIU
AU - Lianrong MA
PY - 2019
DO - 10.1587/transfun.E102.A.1420
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2019
AB - 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.
ER -
English
