Cyclic and constacyclic codes over a non-chain ring

oai:ojs2.jacodesmath.com:article/1In this study, we consider linear and especially cyclic codes over the non-chain ring $Z_{p}[v]/\langle v^{p}-v\rangle$ where $p$ is a prime. This is a generalization of the case $p=3.$ Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and $p$-ary codes and moreover this map enlightens the structure of these codes. Furthermore, a MacWilliams type identity is presented together with some illustrative examples

A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing

Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot. In 1979, the pioneer construction on this area was given by Shamir and Blakley independently. After these initial studies, Asmuth-Bloom and Mignotte have proposed a different $(k,n)$ threshold modular secret sharing scheme by using the Chinese remainder theorem. In this study, we explore the generalization of Mignotte's scheme to Euclidean domains for which we obtain some promising results. Next, we propose new algorithms to construct threshold secret image sharing schemes by using Mignotte's scheme over polynomial rings. Finally, we compare our proposed scheme to the existing ones and we show that this new method is more efficient and it has higher security

On DNA codes from a family of chain rings

In this work, we focus on reversible cyclic codes which correspond to reversible DNA codes or reversible-complement DNA codes over a family of finite chain rings, in an effort to extend what was done by Yildiz and Siap in [20]. The ring family that we have considered are of size $2^{2^k}$, $k=1,2, \cdots$ and we match each ring element with a DNA $2^{k-1}$-mer. We use the so-called $u^2$-adic digit system to solve the reversibility problem and we characterize cyclic codes that correspond to reversible-complement DNA-codes. We then conclude our study with some examples

Cyclic and constacyclic codes over a non-chain ring

In this study, we consider linear and especially cyclic codes over the non-chain ring $Z_{p}[v]/\langle v^{p}-v\rangle$ where $p$ is a prime. This is a generalization of the case $p=3.$ Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and $p$-ary codes and moreover this map enlightens the structure of these codes. Furthermore, a MacWilliams type identity is presented together with some illustrative examples

Cyclic and constacyclic codes over a non-chain ring

In this study, we consider linear and especially cyclic codes over the non-chain ring $Z_{p}[v]/\langle v^{p}-v\rangle$ where $p$ is a prime. This is a generalization of the case $p=3.$ Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and $p$-ary codes and moreover this map enlightens the structure of these codes. Furthermore, a MacWilliams type identity is presented together with some illustrative examples

The Structure of Z2Z2 s-Additive Codes: Bounds on the Minimum Distance

Abstract: Z2Z4-additive codes, as a special class of abelian codes, have found a very welcoming place in the recent studies of algebraic coding theory. This family in one hand is similar to binary codes on the other hand is similar to quaternary codes. The structure ofZ2Z4additive codes and their duals has been determined lately. In this study we investigate the algebraic structure of Z2Z2s-additive codes which are a natural generalization of Z2Z4-additive codes. We present the standard form of the generator and parity-check matrices of the Z2Z2s-additive codes. Also, we give two bounds on the minimum distance of Z2Z2s-additive codes and compare them

THE STRUCTURE OF GENERALIZED QUASI CYCLIC CODES

We investigate the structure of generalized quasi cyclic (GQC) codes. We determine the generator of 1-generator GQC codes and prove a BCH type bound for this family of codes