2016/11/28 by Yongsheng Tang, Tang, Yongsheng, Heqian Xu +3
Computer Science · Engineering · Mathematics · #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
paper · pdf · doi:10.48550/arxiv.1611.09058
arxiv created 2016/11/28 · openalex publication_date 2016/11/28 · arxiv updated 2016/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The Singleton bounds for linear codes over such rings satisfy (d(C)-1)/(A)≤ n-log|R||C|.