Z2[u]Z2[u]-Additive codes

G. Shashirekha; G. R.Vadiraja Bhatta; Prasanna Poojary

doi:10.1142/S179383092350101X

Z2[u]Z2[u]-Additive codes

G. Shashirekha
, G. R.Vadiraja Bhatta^*
, Prasanna Poojary

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

In this paper, we study mixedãlphabet codes over twoãlphabets Z2,ãnd its extension Z2[u] = Z2 + uZ2, u2 = 0. We define new Gray maps, using which we study cyclic codesãnd obtain the properties of their generators. Further, we construct constacyclic codes,ãnd linear codes,ãnd observe the useful properties of their generators. Finally, we present some examples of cyclic codesãnd binary linear codes.

Original language	English
Article number	2350101
Journal	Discrete Mathematics, Algorithms and Applications
DOIs	https://doi.org/10.1142/S179383092350101X
Publication status	Accepted/In press - 2023

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics

Access to Document

10.1142/S179383092350101X

Cite this

@article{549710415315471791df23d2a9dcbdc7,

title = "Z2[u]Z2[u]-Additive codes",

abstract = "In this paper, we study mixed{\~a}lphabet codes over two{\~a}lphabets Z2,{\~a}nd its extension Z2[u] = Z2 + uZ2, u2 = 0. We define new Gray maps, using which we study cyclic codes{\~a}nd obtain the properties of their generators. Further, we construct constacyclic codes,{\~a}nd linear codes,{\~a}nd observe the useful properties of their generators. Finally, we present some examples of cyclic codes{\~a}nd binary linear codes.",

author = "G. Shashirekha and Bhatta, \{G. R.Vadiraja\} and Prasanna Poojary",

year = "2023",

doi = "10.1142/S179383092350101X",

language = "English",

journal = "Discrete Mathematics, Algorithms and Applications",

issn = "1793-8309",

publisher = "World Scientific",

}

TY - JOUR

T1 - Z2[u]Z2[u]-Additive codes

AU - Shashirekha, G.

AU - Bhatta, G. R.Vadiraja

AU - Poojary, Prasanna

PY - 2023

Y1 - 2023

N2 - In this paper, we study mixedãlphabet codes over twoãlphabets Z2,ãnd its extension Z2[u] = Z2 + uZ2, u2 = 0. We define new Gray maps, using which we study cyclic codesãnd obtain the properties of their generators. Further, we construct constacyclic codes,ãnd linear codes,ãnd observe the useful properties of their generators. Finally, we present some examples of cyclic codesãnd binary linear codes.

AB - In this paper, we study mixedãlphabet codes over twoãlphabets Z2,ãnd its extension Z2[u] = Z2 + uZ2, u2 = 0. We define new Gray maps, using which we study cyclic codesãnd obtain the properties of their generators. Further, we construct constacyclic codes,ãnd linear codes,ãnd observe the useful properties of their generators. Finally, we present some examples of cyclic codesãnd binary linear codes.

UR - https://www.scopus.com/pages/publications/85182145819

UR - https://www.scopus.com/pages/publications/85182145819#tab=citedBy

U2 - 10.1142/S179383092350101X

DO - 10.1142/S179383092350101X

M3 - Article

AN - SCOPUS:85182145819

SN - 1793-8309

JO - Discrete Mathematics, Algorithms and Applications

JF - Discrete Mathematics, Algorithms and Applications

M1 - 2350101

ER -

Z2[u]Z2[u]-Additive codes

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this