WebJun 15, 2024 · We define a Gray map φ and obtain many maximum-distance-separable (MDS) and optimal 𝔽_q-linear codes from the Gray images of cyclic codes. Under certain conditions we determine linear complementary dual (LCD) codes of length n when (n,q)≠ 1 and (n,q)= 1, respectively. WebFrobenius ring, Section 3 will show its idempotents and the related decom-position of a R -module in RG. Sections 4 & 5 study when a group code is LCP in the case of the base ring being a a non-commutative finite local ring or a non-commutative finite Frobenius ring respectively. Finally, in Section 6, we deal with checkable codes in RG. 2.
Notes on LCD codes over Frobenius rings ScienceGate
WebNotes on LCD codes over Frobenius rings IEEE Communications Letters . 10.1109/lcomm.2024.3029073 . 2024 . pp. 1-1. Author(s): Zihui Liu . Xin-Wen Wu. Keyword(s): Frobenius Rings . Lcd Codes Download Full-text Download PDF Package. Related Documents; WebKeywords: Homogeneous weight, finite Frobenius rings, reflexive partitions MSC (2000): 94B05, 94B99, 16L60 1 Introduction The homogeneous weight has been studied extensively in the literature of codes over rings. It has been introduced by Constantinescu and Heise [6] as a generalization of both the Hamming orbiting planet has yttrium galore
arXiv:1304.6589v2 [cs.IT] 7 Aug 2013
WebLCD code over a finite commutative ring were obtained. A linear code C with parameter [n,k,d] over a finite field is said to be ... Remark 2.1. Note that, above inner product is generalization of Euclidean ... It is well known that for a Frobenius ring R and a linear code C over the ring R of length n, the product of cardinality of C and C ... WebMar 31, 2024 · On LCP and checkable group codes over finite non-commutative Frobenius rings DeepAI On LCP and checkable group codes over finite non-commutative Frobenius rings 03/31/2024 ∙ by Sanjit Bhowmick, et al. ∙ Universidad de Valladolid ∙ Universidad Del Norte ∙ 0 ∙ share WebJan 30, 2024 · In this paper, we clarify some aspects on LCD codes in the literature. We first prove that a non-free LCD code does not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the existence of LCD code over finite commutative Frobenius rings. orbiting pearl method