Journal
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
Volume 7, Issue 4, Pages -Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S1793830915500585
Keywords
Cyclic codes; minimum generating sets; free cyclic codes
Categories
Funding
- National Key Basic Research Program of China [2013CB834204]
- National Natural Science Foundation of China [61171082, 61301137]
Ask authors/readers for more resources
Let R = Z(q) + uZ(q), where q = p(s) and u(2) = 0. In this paper, minimum generating sets of cyclic codes over R are given. A necessary and sufficient condition for cyclic codes over R to be R-free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
