Relations between Several Minimum Distance Bounds of Binary Cyclic Codes

Taku MATSUO  Yutaka ARAKI  Kyoki IMAMURA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E80-A   No.11   pp.2253-2255
Publication Date: 1997/11/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory/Communication
binary cyclic codes,  minimum distance,  lower bounds,  

Full Text: PDF(127.9KB)>>
Buy this Article

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 dA and secondly dHT dB. We also give binary cyclic codes which satisfy dA dHT.