Results 21 to 30 of about 1,341,218 (213)

Self dual, reversible and complementary duals constacyclic codes over finite local Frobenius non-chain rings of length 5 and nilpotency index 4.

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021
Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A.   +1 more
doaj   +1 more source

On Quantum Stabilizer Codes derived from Local Frobenius Rings [PDF]

open access: yesFinite Fields Their Appl., 2017
In this paper we consider stabilizer codes over local Frobenius rings. First, we study the relative minimum distances of a stabilizer code and its reduction onto the residue field.
H. Gluesing-Luerssen, Tefjol Pllaha
semanticscholar   +1 more source

Constacyclic codes over finite local Frobenius non-chain rings of length 5 and nilpotency index 4

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020
The family of finite local Frobenius non-chain rings of length 5 and nilpotency index 4 is determined, as a by-product all finite local Frobenius non-chain rings with p5 elements (p a prime) and nilpotency index 4 are given.
Castillo-Guillén C. A.   +1 more
doaj   +1 more source

On bounds for codes over Frobenius rings under homogeneous weights

open access: yesDiscrete Mathematics, 2004
Marcus Greferath, Michael E O'Sullivan
exaly   +2 more sources

Double bordered constructions of self-dual codes from group rings over Frobenius rings

open access: yesCryptography and Communications, 2020
In this work, we describe a double bordered construction of self-dual codes from group rings. We show that this construction is effective for groups of order 2 p where p is odd, over the rings F 2 + u F 2 $\mathbb {F}_{2}+u\mathbb {F}_{2}$ and F 4 + u F ...
J. Gildea   +3 more
semanticscholar   +1 more source

Noise Free Fully Homomorphic Encryption Scheme Over Non-Associative Algebra

open access: yesIEEE Access, 2020
Among several approaches to privacy-preserving cryptographic schemes, we have concentrated on noise-free homomorphic encryption. It is a symmetric key encryption that supports homomorphic operations on encrypted data.
Iqra Mustafa   +6 more
doaj   +1 more source

Zassenhaus conjecture for central extensions of S5 [PDF]

open access: yes, 2008
We confirm a conjecture of Zassenhaus about rational conjugacy of torsion units in integral group rings for a covering group of the symmetric group S5 and for the general linear group GLð2; 5Þ. The first result, together with others from the literature,
Bódi, Viktor   +4 more
core   +1 more source

Frobenius and valuation rings [PDF]

open access: yesAlgebra & Number Theory, 2016
The behavior of the Frobenius map is investigated for valuation rings of prime characteristic. We show that valuation rings are always F-pure. We introduce a generalization of the notion of strong F-regularity, which we call F-pure regularity, and show that a valuation ring is F-pure regular if and only if it is Noetherian.
Datta, Rankeya, Smith, Karen
openaire   +2 more sources

Parity check systems of nonlinear codes over finite commutative Frobenius rings [PDF]

open access: yesAdvances in Mathematics of Communications, 2016
The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite commutative ...
Thomas Westerbäck
semanticscholar   +1 more source

The Frobenius Complexity of Hibi Rings [PDF]

open access: yes, 2018
We study the Frobenius complexity of Hibi rings over fields of characteristic p. In particular, for a certain class of Hibi rings (which we call anticanonical level), we compute the limit of the Frobenius complexity as p goes to infinity.
Janet Rose Page (7959728)
core   +3 more sources

Home - About - Disclaimer - Privacy