
International Journal For Multidisciplinary Research
E-ISSN: 2582-2160
•
Impact Factor: 9.24
A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal
Home
Research Paper
Submit Research Paper
Publication Guidelines
Publication Charges
Upload Documents
Track Status / Pay Fees / Download Publication Certi.
Editors & Reviewers
View All
Join as a Reviewer
Reviewer Referral Program
Get Membership Certificate
Current Issue
Publication Archive
Conference
Publishing Conf. with IJFMR
Upcoming Conference(s) ↓
WSMCDD-2025
GSMCDD-2025
Conferences Published ↓
RBS:RH-COVID-19 (2023)
ICMRS'23
PIPRDA-2023
Contact Us
Plagiarism is checked by the leading plagiarism checker
Call for Paper
Volume 7 Issue 1
January-February 2025
Indexing Partners



















On Hamming Distances of (α+uβ)-Constacyclic Codes of Length 4p^s over F_(p^m )+uF_(p^m )
Author(s) | MADHU KANT THAKUR |
---|---|
Country | India |
Abstract | In this paper, we discuss all the Hamming distances of (α+uβ)-constacyclic codes of 4p^s length over the finite chain ring R=F_(p^m )+uF_(p^m ) with u^2=0. Using the structures of (α+uβ)-constacyclic codes of length 4p^s over R, the Hamming distances of all constacyclic codes of length 4p^s over R are determined. We provide some parameters of good codes over R as examples, from which some are new in literature. |
Keywords | Repeated-Root Codes, Constacyclic Codes, Hamming Distance, Finite Chain Ring, MDS Codes. |
Field | Mathematics |
Published In | Volume 7, Issue 1, January-February 2025 |
Published On | 2025-02-07 |
Cite This | On Hamming Distances of (α+uβ)-Constacyclic Codes of Length 4p^s over F_(p^m )+uF_(p^m ) - MADHU KANT THAKUR - IJFMR Volume 7, Issue 1, January-February 2025. DOI 10.36948/ijfmr.2025.v07i01.36646 |
DOI | https://doi.org/10.36948/ijfmr.2025.v07i01.36646 |
Short DOI | https://doi.org/g84d9w |
Share this

E-ISSN 2582-2160

CrossRef DOI is assigned to each research paper published in our journal.
IJFMR DOI prefix is
10.36948/ijfmr
Downloads
All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.
