scholarly journals Self-Dual Abelian Codes in Some Nonprincipal Ideal Group Algebras

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Parinyawat Choosuwan ◽  
Somphong Jitman ◽  
Patanee Udomkavanich
Keyword(s):  
Cyclic Codes ◽  
Group Algebras ◽  
Dual Codes ◽  
Complete Enumeration ◽  
Odd Order ◽  
Abelian Codes ◽  
Positive Integers ◽  
Ideal Group ◽  
Suitable Product

The main focus of this paper is the complete enumeration of self-dual abelian codes in nonprincipal ideal group algebrasF2k[A×Z2×Z2s]with respect to both the Euclidean and Hermitian inner products, wherekandsare positive integers andAis an abelian group of odd order. Based on the well-known characterization of Euclidean and Hermitian self-dual abelian codes, we show that such enumeration can be obtained in terms of a suitable product of the number of cyclic codes, the number of Euclidean self-dual cyclic codes, and the number of Hermitian self-dual cyclic codes of length2sover some Galois extensions of the ringF2k+uF2k, whereu2=0. Subsequently, general results on the characterization and enumeration of cyclic codes and self-dual codes of lengthpsoverFpk+uFpkare given. Combining these results, the complete enumeration of self-dual abelian codes inF2k[A×Z2×Z2s]is therefore obtained.

EXPLICIT DETERMINATION OF CERTAIN MINIMAL ABELIAN CODES AND THEIR MINIMUM DISTANCES

2012 ◽  
Vol 05 (01) ◽  
pp. 1250002
Author(s):  
Pooja Grover ◽  
Ashwani K. Bhandari
Keyword(s):  
Abelian Groups ◽  
Cyclic Codes ◽  
Group Algebras ◽  
Primitive Idempotents ◽  
Abelian Codes ◽  
Complete Set ◽  
Minimum Distances ◽  
Minimal Codes ◽  
Explicit Determination

In this paper minimal codes for several classes of non-cyclic abelian groups have been constructed by explicitly determining a complete set of primitive idempotents in the corresponding group algebras. Some classes of non-p-groups have also been considered. The minimum distances of such abelian codes have been discussed and compared to the minimum distances of cyclic codes of same lengths and dimensions over the same field.

Abelian Codes in Principal Ideal Group Algebras

2013 ◽  
Vol 59 (5) ◽  
pp. 3046-3058 ◽  
Author(s):  
Somphong Jitman ◽  
San Ling ◽  
Hongwei Liu ◽  
Xiaoli Xie
Keyword(s):  
Principal Ideal ◽  
Group Algebras ◽  
Abelian Codes ◽  
Ideal Group

The Gender Troubles of Feofan Prokopovich

2020 ◽  
Vol 54 (1-3) ◽  
pp. 198-228
Author(s):  
Gary Marker
Keyword(s):  
Sharp Contrast ◽  
Close Reading ◽  
Dual Codes ◽  
Minimalist Approach ◽  
Holy Women ◽  
Gender Trouble

Abstract This essay constitutes a close reading of the works of Feofan Prokopovich that touch upon gender and womanhood. Interpretively it is informed by Judith Butler’s book Gender Trouble, specifically by her model of gender-as-performance. Prokopovich’s writings conveyed a negative characterization of holy women and Russian women of power, a combination of glaring silences and Scholastic dual codes that in toto denied the association of womanhood with glory or wisdom. In this he stood apart from other East Slavic Orthodox homilists of his day, even though they too invariably associated virtue with masculinity (muzhestvo). For Prokopovich, wisdom, strength, constancy, etc., were innately masculine. Women, by contrast, were weak, inconstant, non-rational, and guided by emotion. His sermons nominally in praise of Catherine I and Anna Ioannovna were suffused with narrative gestures that, to those attuned to the nuances of Scholastic rhetoric, ran entirely counter to their nominal message. Several panegyrics to Anna, for example, made no mention of her at all, a practice in sharp contrast to his sermons to male rulers, which typically placed the honoree firmly in the foreground. Even more startling is his singularly minimalist approach to Mary, for whom he composed almost no sermons and whose presence he barely mentioned in tracts where one would have expected otherwise. This essay concludes that this attitude reflected both his personal preferences and influence that Protestant Pietism had on his thinking.

scholarly journals New quantum codes from skew constacyclic codes

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Ram Krishna Verma ◽  
Om Prakash ◽  
Ashutosh Singh ◽  
Habibul Islam
Keyword(s):  
Finite Field ◽  
Gray Map ◽  
Quantum Codes ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Chain Ring ◽  
Css Construction ◽  
Positive Integers

<p style='text-indent:20px;'>For an odd prime <inline-formula><tex-math id="M1">\begin{document}$ p $\end{document}</tex-math></inline-formula> and positive integers <inline-formula><tex-math id="M2">\begin{document}$ m $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M3">\begin{document}$ \ell $\end{document}</tex-math></inline-formula>, let <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{F}_{p^m} $\end{document}</tex-math></inline-formula> be the finite field with <inline-formula><tex-math id="M5">\begin{document}$ p^{m} $\end{document}</tex-math></inline-formula> elements and <inline-formula><tex-math id="M6">\begin{document}$ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $\end{document}</tex-math></inline-formula>. Thus <inline-formula><tex-math id="M7">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula> is a finite commutative non-chain ring of order <inline-formula><tex-math id="M8">\begin{document}$ p^{2^{\ell} m} $\end{document}</tex-math></inline-formula> with characteristic <inline-formula><tex-math id="M9">\begin{document}$ p $\end{document}</tex-math></inline-formula>. In this paper, we aim to construct quantum codes from skew constacyclic codes over <inline-formula><tex-math id="M10">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula>. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.</p>

scholarly journals Constacyclic and Linear Complementary Dual Codes Over Fq + uFq

2020 ◽  
Vol 70 (6) ◽  
pp. 626-632
Author(s):  
Om Prakash ◽  
Shikha Yadav ◽  
Ram Krishna Verma
Keyword(s):  
Cyclic Codes ◽  
Gray Map ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Gray Image ◽  
New Class ◽  
Sharing Scheme ◽  
Lcd Codes ◽  
Reversible Cyclic Codes

This article discusses linear complementary dual (LCD) codes over ℜ = Fq+uFq(u2=1) where q is a power of an odd prime p. Authors come up with a new Gray map from ℜn to F2nq and define a new class of codes obtained as the gray image of constacyclic codes over .ℜ Further, we extend the study over Euclidean and Hermitian LCD codes and establish a relation between reversible cyclic codes and Euclidean LCD cyclic codes over ℜ. Finally, an application of LCD codes in multisecret sharing scheme is given.

scholarly journals The characterization of elliptic curves over finite fields

1988 ◽  
Vol 45 (2) ◽  
pp. 275-286 ◽  
Author(s):  
J. W. P. Hirschfeld ◽  
J. F. Voloch
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Maximum Size ◽  
Desarguesian Plane ◽  
Cubic Curve ◽  
Odd Order ◽  
Even Order ◽  
Curves Over Finite Fields

AbstractIn a finite Desarguesian plane of odd order, it was shown by Segre thirty years ago that a set of maximum size with at most two points on a line is a conic. Here, in a plane of odd or even order, sufficient conditions are given for a set with at most three points on a line to be a cubic curve. The case of an elliptic curve is of particular interest.

Structure of repeated-root constacyclic codes of length 8ℓmpn

2019 ◽  
Vol 12 (04) ◽  
pp. 1950050
Author(s):  
Saroj Rani
Keyword(s):  
Finite Field ◽  
Linear Codes ◽  
Important Class ◽  
Constacyclic Codes ◽  
Dual Codes ◽  
Negacyclic Codes ◽  
Positive Integers

Constacyclic codes form an important class of linear codes which is remarkable generalization of cyclic and negacyclic codes. In this paper, we assume that [Formula: see text] is the finite field of order [Formula: see text] where [Formula: see text] is a power of the prime [Formula: see text] and [Formula: see text] are distinct odd primes, and [Formula: see text] are positive integers. We determine generator polynomials of all constacyclic codes of length [Formula: see text] over the finite field [Formula: see text] We also determine their dual codes.

Sign in / Sign up

Export Citation Format

Share Document