Published January 1, 2015
| Version v1
Journal article
Open
On some bounds on the minimum distance of cyclic codes over finite fields
Creators
- 1. Middle E Tech Univ, Inst Appl Math, TR-06800 Ankara, Turkey
Description
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bounds on the minimum distance of cyclic codes over finite fields. Here we present some results on a generalization of this method. Then we apply it to several examples of cyclic codes and compare some known bounds with the bounds obtained by this generalization.
Files
bib-c881b019-2050-4691-9a24-d48bb29706aa.txt
Files
(167 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:5f1fab102c6e7ee96c907266d4833150
|
167 Bytes | Preview Download |