首页 | 官方网站   微博 | 高级检索  
     


Bounds on Minimum Distance for Linear Codes over GF(5)
Authors:Rumen N Daskalov  T Aaron Gulliver
Affiliation:(1) Department of Mathematics, Technical University, BG-5300 Gabrovo, Bulgaria (e-mail:daskalov@tugab.bg), BG;(2) Department of Electrical and Electronic Engineering, University of Canterbury, Private Bag 4800, Christchurch, New Zealand (e-mail: gulliver@elec.canterbury.ac.nz.), NZ
Abstract:Let n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). Let d 5(n, k) be the maximum possible minimum Hamming distance of a linear n, k, d; 5]-code for given values of n and k. In this paper, forty four new linear codes over GF(5) are constructed and a table of d 5(n, k) k≤ 8, n≤ 100 is presented.
Keywords:: Quasi-cyclic codes  Linear codes over GF(5)
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号