Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Xidian University》 1988-02
Add to Favorite Get Latest Update

The Application Method of the Latest Bound——LW Bound on the Minimum Distance of Cyclic Codes and Some Unsolved Problems

Li Yuanxing  
So far,there have been four main bounds on the minimum distance of cyclic codes:BCH bound(1960),HT bound(1972),Roos bound(1983)and LW bound recnetly presented by van Lint and Wilson in 1986.Since the LW bound does not present a concrete method for finding out the bound on the minimum distance of cyclic codes,so a brief description of it is made here and emphasis is laid on the explanation of its application method,with some unsolved problems pointed out.Finally,the usefulness of the method presented in the paper is exemplified.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved