Repository logo
Institutional Repository
Communities & Collections
Browse
Quick Links
  • Central Library
  • Digital Library
  • BHU Website
  • BHU Theses @ Shodhganga
  • BHU IRINS
  • Login
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Pramod Kumar Kewat"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    PublicationArticle
    Constacyclic codes of length (pr, ps) over mixed alphabets
    (Springer Science and Business Media Deutschland GmbH, 2021) Hai Q. Dinh; Tushar Bag; Pramod Kumar Kewat; Sachin Pathak; Ashish K. Upadhyay; Warattaya Chinnakum
    For any prime p and positive integer m, let R be the finite commutative ring Fpm+uFpm+vFpm+uvFpm, whereu2= 0 , v2= 0 and uv= vu. Let λ= λ1+ uλ2+ vλ3+ uvλ4 be a unit of R, where λ1,λ2,λ3,λ4∈Fpm and λ1≠ 0. We know that λ-constacyclic codes of length ps over R are exactly ideals of the ring R[x]⟨xps-λ⟩. For all possible values of λ, we study λ-constacyclic codes of length ps over R. We also extend structures of codes from single alphabet to mixed alphabet, and determine separable constacyclic codes of length (pr, ps) over FpmR. © 2021, Korean Society for Informatics and Computational Applied Mathematics.
An Initiative by BHU – Central Library
Powered by Dspace