Results 1 to 10 of about 4,293,336 (15)

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

Construction of reversible cyclic codes over 𝔽q + u𝔽q + u2𝔽q

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023
Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = 𝔽q +u𝔽q + u2𝔽q, where u3 = 0 mod q.
Rehman Nadeem ur   +2 more
doaj   +1 more source

DNA 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, 2022
A one to one correspondence between the elements of a finite local Frobenius non-chain ring of length 5 and nilpotency index 4, and k-tuples of DNA codewords is established.
Castillo-Guillén C. A.   +1 more
doaj   +1 more source

Self-Dual Cyclic Codes Over M2(ℤ4)

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2022
In this paper, we study the structure of cyclic codes overM2(ℤ4) (the matrix ring of matrices of order 2 over ℤ4), which is perhaps the first time that the ring is considered as a code alphabet.
Bhowmick Sanjit   +3 more
doaj   +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

Two-dimensional cyclic codes over a finite chain ring

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
In this paper, we have determined the generators and rank of a 2D cyclic code of length mn over a finite chain ring ℛ with residue field 𝔽q, where m is arbitrary and q ≡ 1(mod n).
Garg Disha, Dutt Sucheta
doaj   +1 more source

Skew cyclic codes over 𝔻4R and their applications to DNA codes construction

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
The fundamental aim of this research is to analyze the configuration of 𝔽4R submodules, skew cyclic codes over 𝔽4R and establish their connection with DNA codes, where 𝔽4 is a field of order 4 and R = 𝔽4 + u𝔽4 + v𝔽4 + w𝔽4 with u2 = u, v2 = v, w2 = w, uv =
Rehman Nadeem ur   +2 more
doaj   +1 more source

Bakewell Primary School newsletter

open access: yes, 2020
Fortnightly during school terms.An Independent Public School Delivering Excellence in EducationMade available via the Publications (Legal Deposit) Act 2004 (NT).This publication contains many links to external sites. These external sites may no longer be

core   +16 more sources

Bakewell Primary School newsletter

open access: yes, 2019
Fortnightly during school terms.An Independent Public School Delivering Excellence in EducationMade available via the Publications (Legal Deposit) Act 2004 (NT).This publication contains many links to external sites. These external sites may no longer be

core   +15 more sources

Bakewell Primary School newsletter

open access: yes, 2018
Fortnightly during school terms.An Independent Public School Delivering Excellence in EducationMade available via the Publications (Legal Deposit) Act 2004 (NT).This publication contains many links to external sites. These external sites may no longer be

core   +11 more sources

Home - About - Disclaimer - Privacy