2015/01/16 by Jian Gao, Fang-Wei Fu, Fang‐Wei Fu +7
Computer Science · Engineering · Mathematics · #11T71 #94B05 #Coding theory and cryptography #FOS: Computer and information sciences #Finite Group Theory Research #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT #msc:11T71 #msc:94B05
paper · pdf · doi:10.48550/arxiv.1501.03924
11. arXiv admin note: text overlap with arXiv:1309.1623
openalex publication_date 2015/01/16 · arxiv created 2015/04/26 · arxiv updated 2015/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let R=ℤq+uℤq, where q=ps and u2=0. In this paper, some structural properties of cyclic codes over the ring R are considered. A necessary and sufficient condition for cyclic codes over the ring R to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given.