site stats

Notes on lcd codes over frobenius rings

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 https://wearepak.com

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

ON LCP AND CHECKABLE GROUP CODES OVER FINITE NON …

Category:Galois LCD codes over rings - aimsciences.org

Tags:Notes on lcd codes over frobenius rings

Notes on lcd codes over frobenius rings

Frobenius Ring - an overview ScienceDirect Topics

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. … WebWe define a basis of a code over a finite Frobenius ring as a system of vectors that is independent, modular independent, and spanning. As noted in [1, Remark 2], the two properties of independence and modular independence are logically independent. Exercise 5.7 Let , and , . Show that the system is modular independent, but not independent.

Notes on lcd codes over frobenius rings

Did you know?

WebMay 22, 2016 · It is proved that non-free LCD codes do not exist over finite commutative Frobenius local rings, and it is shown that a free constacyclic code over a finite chain ring is an LCD code if and only if it is reversible. 21 PDF ... 1 2 3 ... References SHOWING 1-6 OF 6 REFERENCES Hulls of cyclic and negacyclic codes over finite fields WebJul 24, 2024 · Some research work on LCD codes over finite Frobenius rings are also carried out. In 2015, Liu et al. [ 9] studied LCD codes over chain rings, and as the main result, they presented a condition for a free code over chain rings to be an LCD code.

Weblinear ℓ-intersection pair of codes over a finite chain ring is observed as a generalization of LCD and LCP codes over a finite chain ring. LCD codes have been first introduced by … WebOct 7, 2024 · We first prove that non-free LCD codes do not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the existence of LCD codes over a finite ...

WebKeywords Frobenius ring · Linear complementary dual code · Constacyclic code · Chain ring ... Recently, in [20], Liu and Liu studied LCD codes over finite chain rings and provided a necessary and sufficient condition for a free linear code to be an LCD code over a finite chain ring. They also gave a sufficient condition [20, Theorem 3.5 ... WebIn this work, we shall be largely concerned with codes over finite fields. However, we shall use codes over rings together with a linear Gray map to construct LCD codes. Hence we shall make the definitions in a general setting. A code C of length n over a ring R is a subset of Rn. All rings in this paper are assumed to be commutative rings ...

WebOct 1, 2024 · Existence of non-free LCD codes over R e, q. In [4], the authors proved that there does not exist any non-free LCD codes over a finite commutative local Frobenius ring, or in other words, every LCD code over a commutative local Frobenius ring is free. Also, the authors gave the conditions in case of a non-local ring for a code to be LCD.

WebFeb 1, 2024 · This paper sets a foundation for the study of linear codes over finite rings. The finite Frobenius rings are singled out as the most appropriate for coding theoretic … orbiting outpost什么意思WebJan 20, 2024 · 4 Constacyclic LCD codes over finite chain rings Lemma 7. For a polynomial f ( X) of degree r, f^* (X) denotes its reciprocal polynomial and is given by f^* (X)=X^rf... orbiting opulence - whiteWebOct 6, 2024 · Notes on LCD Codes Over Frobenius Rings Abstract: Let R be a commutative Frobenius local ring. A result that the injective hull of an LCD code C over R. is free of dimension 1(C), where 1(C) is the minimum over the cardinalities of the generating sets … ipower foundationWebNote that a left and right self-injective semi-primary ring is quasi-Frobenius. (4) The problem whether a self-injective cogenerator ring on the left side (left PF-ring) is a right PF-ring was unsolved until the middle of the 1980's (see Azumaya [Az66], Faith [F76]). Dischinger and W. MüUller [DM86] gave a counterexample in 1986 to this problem. ipower ftpWebOct 6, 2024 · In this paper, we clarify some aspects of LCD codes in the literature. We first prove that non-free LCD codes do not exist over finite commutative Frobenius local rings. … ipower flower trimmerWebDec 11, 2013 · Abstract. Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes … orbiting pearl instructionsWebDec 11, 2013 · with the original linear code, holds for linear codes over finite F rob enius rings. A special class of finite F robenius rings consists o f the finite chain rings, and codes over... ipower g5800 motherboard