Relations between well-known bounds for the minimum distance of binary cyclic codes such as BCH bound (dBCH), HT bound (dHT) and new bounds dA, dB proposed recently by Shen et al. are investigated. We prove firstly dBCH
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.
Copy
Taku MATSUO, Yutaka ARAKI, Kyoki IMAMURA, "Relations between Several Minimum Distance Bounds of Binary Cyclic Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E80-A, no. 11, pp. 2253-2255, November 1997, doi: .
Abstract: Relations between well-known bounds for the minimum distance of binary cyclic codes such as BCH bound (dBCH), HT bound (dHT) and new bounds dA, dB proposed recently by Shen et al. are investigated. We prove firstly dBCH
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e80-a_11_2253/_p
Copy
@ARTICLE{e80-a_11_2253,
author={Taku MATSUO, Yutaka ARAKI, Kyoki IMAMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Relations between Several Minimum Distance Bounds of Binary Cyclic Codes},
year={1997},
volume={E80-A},
number={11},
pages={2253-2255},
abstract={Relations between well-known bounds for the minimum distance of binary cyclic codes such as BCH bound (dBCH), HT bound (dHT) and new bounds dA, dB proposed recently by Shen et al. are investigated. We prove firstly dBCH
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Relations between Several Minimum Distance Bounds of Binary Cyclic Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2253
EP - 2255
AU - Taku MATSUO
AU - Yutaka ARAKI
AU - Kyoki IMAMURA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1997
AB - Relations between well-known bounds for the minimum distance of binary cyclic codes such as BCH bound (dBCH), HT bound (dHT) and new bounds dA, dB proposed recently by Shen et al. are investigated. We prove firstly dBCH
ER -