Published January 1, 2009
| Version v1
Conference paper
Open
The Minimum Hamming Distance of Cyclic Codes of Length 2 p(s)
Creators
- 1. Middle E Tech Univ, Inst Appl Math, Dept Mat, TR-06531 Ankara, Turkey
Description
We study cyclic codes of length 2p(s) over F-q where p is an odd prime. Using the results of [1], we compute the minimum Hamming distance of these codes.
Files
bib-d30f2bb3-b7cb-49ec-9b0b-2fca51f1f9e3.txt
Files
(161 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:cc8c4e9255c53f345e0825d8440b05e5
|
161 Bytes | Preview Download |