CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}]$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING

2012 ◽  
Vol 04 (04) ◽  
pp. 1250059 ◽  
Author(s):  
TARIQ SHAH ◽  
ANTONIO APARECIDO DE ANDRADE
Keyword(s):  
Positive Integer ◽  
Commutative Ring ◽  
Cyclic Codes ◽  
Bch Codes ◽  
Goppa Codes ◽  
Monoid Ring ◽  
Alternant Codes ◽  
Almost All

Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and [Formula: see text] is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring [Formula: see text]. For a = 1, almost all the results contained in [16] stands as a very particular case of this study.

Sign changes of Fourier coefficients of cusp forms supported on prime power indices

2014 ◽  
Vol 10 (08) ◽  
pp. 1921-1927 ◽  
Author(s):  
Winfried Kohnen ◽  
Yves Martin
Keyword(s):  
Positive Integer ◽  
Prime Power ◽  
Fourier Coefficients ◽  
Cusp Forms ◽  
Power Indices ◽  
Hecke Operator ◽  
Sign Changes ◽  
Integral Weight ◽  
Hecke Eigenform ◽  
Almost All

Let f be an even integral weight, normalized, cuspidal Hecke eigenform over SL2(ℤ) with Fourier coefficients a(n). Let j be a positive integer. We prove that for almost all primes p the sequence (a(pjn))n≥0 has infinitely many sign changes. We also obtain a similar result for any cusp form with real Fourier coefficients that provide the characteristic polynomial of some generalized Hecke operator is irreducible over ℚ.

scholarly journals Primitive Idempotents of Irreducible Cyclic Codes of Length n

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Yuqian Lin ◽  
Qin Yue ◽  
Yansheng Wu
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Matrix Method ◽  
Cyclic Codes ◽  
Prime Divisors ◽  
Primitive Idempotents ◽  
Irreducible Cyclic Codes

Let Fq be a finite field with q elements and n a positive integer. In this paper, we use matrix method to give all primitive idempotents of irreducible cyclic codes of length n, whose prime divisors divide q-1.

scholarly journals A characterization of minimal prime ideals

1998 ◽  
Vol 40 (2) ◽  
pp. 223-236 ◽  
Author(s):  
Gary F. Birkenmeier ◽  
Jin Yong Kim ◽  
Jae Keol Park
Keyword(s):  
Positive Integer ◽  
Prime Ideal ◽  
Commutative Ring ◽  
Minimal Prime Ideal ◽  
Prime Ideals ◽  
Sheaf Representations ◽  
Minimal Prime

AbstractLet P be a prime ideal of a ring R, O(P) = {a ∊ R | aRs = 0, for some s ∊ R/P} | and Ō(P) = {x ∊ R | xn ∊ O(P), for some positive integer n}. Several authors have obtained sheaf representations of rings whose stalks are of the form R/O(P). Also in a commutative ring a minimal prime ideal has been characterized as a prime ideal P such that P= Ō(P). In this paper we derive various conditions which ensure that a prime ideal P = Ō(P). The property that P = Ō(P) is then used to obtain conditions which determine when R/O(P) has a unique minimal prime ideal. Various generalizations of O(P) and Ō(P) are considered. Examples are provided to illustrate and delimit our results.

scholarly journals On the sum of digits of some sequences of integers

2013 ◽  
Vol 11 (1) ◽  
Author(s):  
Javier Cilleruelo ◽  
Florian Luca ◽  
Juanjo Rué ◽  
Ana Zumalacárregui
Keyword(s):  
Number Theory ◽  
Positive Integer ◽  
Integer Sequences ◽  
Sum Of Digits ◽  
Fixed Positive Integer ◽  
Almost All

AbstractLet b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.

McCOY PROPERTY OF SKEW LAURENT POLYNOMIALS AND POWER SERIES RINGS

2013 ◽  
Vol 13 (02) ◽  
pp. 1350083 ◽  
Author(s):  
A. ALHEVAZ ◽  
D. KIANI
Keyword(s):  
Power Series ◽  
Commutative Ring ◽  
Commutative Rings ◽  
Laurent Polynomials ◽  
Property A ◽  
Power Series Ring ◽  
Series Ring ◽  
Monoid Ring ◽  
Power Series Rings ◽  
Base Ring

One of the important properties of commutative rings, proved by McCoy [Remarks on divisors of zero, Amer. Math. Monthly49(5) (1942) 286–295], is that if two nonzero polynomials annihilate each other over a commutative ring then each polynomial has a nonzero annihilator in the base ring. Nielsen [Semi-commutativity and the McCoy condition, J. Algebra298(1) (2006) 134–141] generalizes this property to non-commutative rings. Let M be a monoid and σ be an automorphism of a ring R. For the continuation of McCoy property of non-commutative rings, in this paper, we extend the McCoy's theorem to skew Laurent power series ring R[[x, x-1; σ]] and skew monoid ring R * M over general non-commutative rings. Constructing various examples, we classify how these skew versions of McCoy property behaves under various ring extensions. Moreover, we investigate relations between these properties and other standard ring-theoretic properties such as zip rings and rings with Property (A). As a consequence we extend and unify several known results related to McCoy rings.

scholarly journals On the generalized Ramanujan-Nagell equation $ x^2+(2k-1)^y = k^z $ with $ k\equiv 3 $ (mod 4)

2021 ◽  
Vol 6 (10) ◽  
pp. 10596-10601
Author(s):  
Yahui Yu ◽  
◽  
Jiayuan Hu ◽  
Keyword(s):  
Positive Integer ◽  
Unsolved Problem ◽  
Integer Solution ◽  
Positive Integer Solution ◽  
Elementary Methods ◽  
Fixed Positive Integer ◽  
Almost All ◽  
Terai’S Conjecture ◽  
Positive Integers

<abstract><p>Let $ k $ be a fixed positive integer with $ k &gt; 1 $. In 2014, N. Terai <sup>[<xref ref-type="bibr" rid="b6">6</xref>]</sup> conjectured that the equation $ x^2+(2k-1)^y = k^z $ has only the positive integer solution $ (x, y, z) = (k-1, 1, 2) $. This is still an unsolved problem as yet. For any positive integer $ n $, let $ Q(n) $ denote the squarefree part of $ n $. In this paper, using some elementary methods, we prove that if $ k\equiv 3 $ (mod 4) and $ Q(k-1)\ge 2.11 $ log $ k $, then the equation has only the positive integer solution $ (x, y, z) = (k-1, 1, 2) $. It can thus be seen that Terai's conjecture is true for almost all positive integers $ k $ with $ k\equiv 3 $(mod 4).</p></abstract>

scholarly journals The Proof of a Conjecture on the Density of Sets Related to Divisibility Properties of z(n)

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2912
Author(s):  
Eva Trojovská ◽  
Venkatachalam Kandasamy
Keyword(s):  
Positive Integer ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Natural Density ◽  
Almost All ◽  
Divisibility Properties

Let (Fn)n be the sequence of Fibonacci numbers. The order of appearance (in the Fibonacci sequence) of a positive integer n is defined as z(n)=min{k≥1:n∣Fk}. Very recently, Trojovská and Venkatachalam proved that, for any k≥1, the number z(n) is divisible by 2k, for almost all integers n≥1 (in the sense of natural density). Moreover, they posed a conjecture that implies that the same is true upon replacing 2k by any integer m≥1. In this paper, in particular, we prove this conjecture.

scholarly journals The properties and parameters of generic Bose – Chaudhuri – Hocquenghem codes

2020 ◽  
Vol 56 (2) ◽  
pp. 157-165
Author(s):  
A. V. Kushnerov ◽  
V. A. Lipinski ◽  
M. N. Koroliova
Keyword(s):  
Error Correction ◽  
Cyclic Codes ◽  
Error Correcting Code ◽  
Error Correcting Codes ◽  
Bch Codes ◽  
Close Connection ◽  
Design Parameters ◽  
Polynomial Invariants ◽  
Accurate Evaluation

The Bose – Chaudhuri – Hocquenghem type of linear cyclic codes (BCH codes) is one of the most popular and widespread error-correcting codes. Their close connection with the theory of Galois fields gave an opportunity to create a theory of the norms of syndromes for BCH codes, namely, syndrome invariants of the G-orbits of errors, and to develop a theory of polynomial invariants of the G-orbits of errors. This theory as a whole served as the basis for the development of effective permutation polynomial-norm methods and error correction algorithms that significantly reduce the influence of the selector problem. To date, these methods represent the only approach to error correction with non-primitive BCH codes, the multiplicity of which goes beyond design boundaries. This work is dedicated to a special error-correcting code class – generic Bose – Chaudhuri – Hocquenghem codes or simply GBCH-codes. Sufficiently accurate evaluation of the quantity of such codes in each length was produced during our work. We have investigated some properties and connections between different GBCH-codes. Special attention was devoted to codes with constructive distances of 3 and 5, as those codes are usual for practical use. Their almost complete description is given in the range of lengths from 7 to 107. The paper contains a fairly clear theoretical classification of GBCH-codes. Special attention is paid to the corrective capabilities of the codes of this class, namely, to the calculation of the minimal distances of these codes with various parameters. The codes are found whose corrective capabilities significantly exceed those of the well-known GBCH-codes with the same design parameters.

scholarly journals EXTENDED SUBCLASS OF CYCLIC SEPARABLE GOPPA CODES

2016 ◽  
Vol 15 (5) ◽  
pp. 6776-6784
Author(s):  
Ajay Sharma ◽  
O. P. VINOCHA
Keyword(s):  
Cyclic Codes ◽  
Goppa Codes ◽  
Goppa Code

In 2013[4]a new subclass of cyclic Goppa code with Goppa polynomial of degree 2 is presented by Bezzateev and Shekhunova. They proved that this subclass contains all cyclic codes of considered length. In the present work we consider a Goppa polynomial of degree three and proved that the subclass generated by this polynomial represent a cyclic, reversible and separable Goppa code.

scholarly journals On 1-absorbing primary ideals of commutative rings

2019 ◽  
Vol 19 (06) ◽  
pp. 2050111 ◽  
Author(s):  
Ayman Badawi ◽  
Ece Yetkin Celikel
Keyword(s):  
Positive Integer ◽  
Prime Ideal ◽  
Commutative Ring ◽  
Commutative Rings ◽  
Proper Ideal ◽  
Primary Ideal ◽  
Ideal Formula ◽  
Noetherian Domain ◽  
Primary Ideals ◽  
Nonzero Identity

Let [Formula: see text] be a commutative ring with nonzero identity. In this paper, we introduce the concept of 1-absorbing primary ideals in commutative rings. A proper ideal [Formula: see text] of [Formula: see text] is called a [Formula: see text]-absorbing primary ideal of [Formula: see text] if whenever nonunit elements [Formula: see text] and [Formula: see text], then [Formula: see text] or [Formula: see text] Some properties of 1-absorbing primary ideals are investigated. For example, we show that if [Formula: see text] admits a 1-absorbing primary ideal that is not a primary ideal, then [Formula: see text] is a quasilocal ring. We give an example of a 1-absorbing primary ideal of [Formula: see text] that is not a primary ideal of [Formula: see text]. We show that if [Formula: see text] is a Noetherian domain, then [Formula: see text] is a Dedekind domain if and only if every nonzero proper 1-absorbing primary ideal of [Formula: see text] is of the form [Formula: see text] for some nonzero prime ideal [Formula: see text] of [Formula: see text] and a positive integer [Formula: see text]. We show that a proper ideal [Formula: see text] of [Formula: see text] is a 1-absorbing primary ideal of [Formula: see text] if and only if whenever [Formula: see text] for some proper ideals [Formula: see text] of [Formula: see text], then [Formula: see text] or [Formula: see text]

Sign in / Sign up

Export Citation Format

Share Document