Notes on lcd codes over frobenius rings

Author: kuaz

August undefined, 2024

WebJan 30, 2024 · In Section 3, we discuss LCD codes over finite commutative Frobenius rings. Finally, Section 4 studies the complementary dual constacyclic codes over finite chain … 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 …

arXiv:1304.6589v2 [cs.IT] 7 Aug 2013

WebJul 1, 2015 · Under suitable conditions, we provide a necessary and sufficient condition for LCD linear codes over finite chain rings. • We characterize LCD linear codes over finite … 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 citydoc head office

(PDF) Matrix product codes over finite commutative …

WebLCD code over a ﬁnite commutative ring were obtained. A linear code C with parameter [n,k,d] over a ﬁnite ﬁeld 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 ... Weblinear ℓ-intersection pair of codes over a ﬁnite chain ring is observed as a generalization of LCD and LCP codes over a ﬁnite chain ring. LCD codes have been ﬁrst introduced by … 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 ﬁnite local ring or a non-commutative ﬁnite Frobenius ring respectively. Finally, in Section 6, we deal with checkable codes in RG. 2. dictionary\u0027s 0s

Galois LCD Codes Over Fq + uFq + vFq + uvFq - arxiv.org

LCP of group codes over finite Frobenius rings - ResearchGate

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; WebNote 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. dictionary\\u0027s 0qWebOct 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. citydoc ft worth tx

"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 … " - Notes on lcd codes over frobenius rings

Notes on lcd codes over frobenius rings

ON LCP AND CHECKABLE GROUP CODES OVER FINITE NON …

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 … WebFeb 28, 2024 · The structure of the generalized Galois LCD codes over chain rings can be used to construct Galois LCD codes over finite fields. By using the structure of the …

Did you know?

WebIn this work, we shall be largely concerned with codes over ﬁnite ﬁelds. However, we shall use codes over rings together with a linear Gray map to construct LCD codes. Hence we shall make the deﬁnitions 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 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. …

WebJul 5, 2024 · We give constructions of self-dual codes over any Frobenius ring. We describe connections to unimodular lattices, binary self-dual codes and to designs. We also describe linear complementary dual codes and make a new definition of a broad generalization encompassing both self-dual and linear complementary codes. Download chapter PDF WebNov 24, 2024 · We determine the algebraic structures of all NIE-constacyclic codes over finite chain rings, give the unique form of the sets of the defining polynomials and obtain their minimum Hamming distances. A general form of the duals of NIE-constacyclic codes over finite chain rings is also provided.

WebLCD code does not exist over ﬁnite commutative Frobenius local rings. We then obtain a necessary and sufﬁcient condition for the existence of LCD code over ﬁnite commutative Frobenius rings. We later show that a free constacyclic code over ﬁnite chain ring is LCD if and only if it is reversible, and WebJan 1, 2024 · Article on Galois LCD codes over rings, published in Advances in Mathematics of Communications 0 on 2024-01-01 by Zihui Liu. Read the article Galois LCD codes over rings on R Discovery, your go-to avenue for effective literature search. ... We describe the judging criterions for a generalized Galois LCD code over a Frobenius ring by introducing ...

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.

WebDec 11, 2013 · with the original linear code, holds for linear codes over ﬁnite F rob enius rings. A special class of ﬁnite F robenius rings consists o f the ﬁnite chain rings, and codes over... dictionary\\u0027s 0uWebLinear codes over a ﬁnite Frobenius ring also have the extension property [16]. Following a strategy of Dinh and L´opez-Permouth [4], the main result of this paper is that ﬁnite Frobenius rings are characterized by the extension property. That is, if the extension property holds for linear codes over a ﬁnite ring R,thenR is a dictionary\\u0027s 0tWebDec 11, 2013 · Abstract. Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes … dictionary\u0027s 0rWebJul 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. citydoc hounslowWebJan 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. dictionary\u0027s 0tWebKeywords Frobenius ring · Linear complementary dual code · Constacyclic code · Chain ring ... Recently, in [20], Liu and Liu studied LCD codes over ﬁnite chain rings and provided a necessary and sufﬁcient condition for a free linear code to be an LCD code over a ﬁnite chain ring. They also gave a sufﬁcient condition [20, Theorem 3.5 ... citydoc helpWebKeywords: Homogeneous weight, ﬁnite Frobenius rings, reﬂexive 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 citydoc hendon