SavedAdd your journal

Journals / An International Journal of Optimization and Control: Theories & Applications (IJOCTA) / 2018 / Cilt: 8 - Sayı: 1

The structure of one weight linear and cyclic codes over Zr 2 × (Z2 + uZ2)s

İsmail AYDOĞDU
Pages
92–101
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

We classify one weight Z2Z2[u]-cyclic codes and alsogive some illustrative examples.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Inspired by the Z2Z4-additive codes, linear codes over Zr2 × (Z2 + uZ2)s havebeen introduced by Aydogdu et al. more recently.
📊
Key Findings & Data:Although these familyof codes are similar to each other, linear codes over Zr2 × (Z2 + uZ2)s havesome advantages compared to Z2Z4-additive codes.
💡
Conclusion & Impact:We classify one weight Z2Z2[u]-cyclic codes and alsogive some illustrative examples.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Inspired by the Z2Z4-additive codes, linear codes over Zr2 × (Z2 + uZ2)s havebeen introduced by Aydogdu et al. more recently. Although these familyof codes are similar to each other, linear codes over Zr2 × (Z2 + uZ2)s havesome advantages compared to Z2Z4-additive codes. A code is called constantweight (one weight) if all the nonzero codewords have the same weight. It iswell known that constant weight or one weight codes have many importantapplications. In this paper, we study the structure of one weight Z2Z2[u]-linear and cyclic codes. We classify one weight Z2Z2[u]-cyclic codes and alsogive some illustrative examples.

🔖

Cite This Article

AYDOĞDU, İ. (2022). The structure of one weight linear and cyclic codes over Zr 2 × (Z2 + uZ2)s. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), Cilt: 8 - Sayı: 1, 92–101. https://ajindex.com/articles/440628

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (14)

  1. Hammons, A. R., Kumar, V., Calderbank, A. R., Sloane, N.J.A. and Sol´e, P. (1994). The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory, 40, 301-319.
  2. Calderbank, A.R. and Sloane, N.J.A. (1995). Modular and p-adic cyclic codes. Designs, Codes and Cryptog- raphy, 6, 21-35.
  3. Greferath, M. and Schmidt, S. E. (1999). Gray isome- tries for finite chain rings. IEEE Trans. Info. Theory, 45(7), 2522-2524.
  4. Honold, T. and Landjev, I. (1998). Linear codes over finite chain rings. In Optimal Codes and Related Top- ics, 116-126,
  5. Sozopol, Bulgaria. Borges, J., Fern´andez-C´ordoba, C., Pujol, J., Rif`a, J. and Villanueva, M. (2010). Z2Z4-linear codes: Gener- ator Matrices and Duality. Designs, Codes and Cryp- tography, 54(2), 167-179.
  6. Aydogdu, I. and Siap, I. (2013). The structure of Z2Z2s−Additive codes: bounds on the minimum distance. Applied Mathematics and Information Sci- ences(AMIS), 7(6), 2271-2278.
  7. Aydogdu, I. and Siap, I. (2015). On ZprZps -additive codes. Linear and Multilinear Algebra,, 63(10), 2089- 2102. Abualrub, T., Siap, I. and Aydin, N. (2014). Z2Z4- additive cyclic codes. IEEE Trans. Inf. Theory, 60(3), 1508-1514.
  8. Dougherty, S.T., Liu, H. and Yu, L. (2016). One Weight Z2Z4 additive codes. Applicable Algebra in En- gineering, Communication and Computing, 27, 123- 138. Carlet, C. (2000). One-weight Z4-linear codes, In: Buchmann, J., Høholdt, T., Stichtenoth, H., Tapia- Recillas,H. (eds.) Coding Theory, Cryptography and Related Areas. 57-72.
  9. Springer, Berlin. Wood, J.A.(2002) The structure of linear codes of con- stant weight. Trans. Am. Math. Soc. 354, 1007-1026.
  10. Skachek, V. and Schouhamer Immink, K.A. (2014). Constant weight codes: An approach based on Knuth’s balancing method. IEEE Journal on Selected Areas in Communications, 32(5), 909-918.
  11. Telatar, I.E. and Gallager, R.G (1990). Zero error de- cision feedback capacity of discrete memoryless chan- nels. in BILCON-90: Proceedings of 1990 Bilkent In- ternational Conference on New Trends in Communi- cation, Control and Signal Processing, E. Arikan, Ed. Elsevier, 228-233.
  12. Dyachkov, A.G. (1984). Random constant compo- sition codes for multiple access channels. Problems Control Inform. Theory/Problemy Upravlen. Teor. In- form., 13(6), 357-369.
  13. Ericson, T. and Zinoviev, V. (1995). Spherical codes generated by binary partitions of symmetric point sets. IEEE Trans. Inform. Theory, 41(1), 107-129.
  14. King, O.D. (2003). Bounds for DNA codes with con- stant GC-content. Electron.