Quasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p kZ, 1)

α
Dr Pemha Binyam Gabriel Cedric
Dr Pemha Binyam Gabriel Cedric
σ
Pemha Binyam Gabriel Cedric
Pemha Binyam Gabriel Cedric
α University of Douala University of Douala

Send Message

To: Author

Quasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p  kZ, 1)

Article Fingerprint

ReserarchID

YF948

Quasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p  kZ, 1) Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

The sets present an enrichment from the logical viewpoint compared with the classical sets. The subset of the invariants of a set is a classical set, which leads to the canonical construction of the structures of modal valent pseudo field. In this note the purpose is to define on a finite chain pseudo field, , the structures of Quasi-Cyclic codes of length r.

Generating HTML Viewer...

References

18 Cites in Article
  1. J Jensen (1985). The concatenated structure of cyclic and Abelian codes.
  2. V Pless,Z Qian (1996). Cyclic codes and quadratic residue codes over.
  3. A Norton,Slgean-Mandache (2000). On the structure of linear cyclic codes over finite chain rings.
  4. A Norton,Slgean-Mandache (2000). On the structure of linear cyclic codes over finite chain rings.
  5. F Eteme,J Tsimi (2011). A approach of the algebraic theory of linear codes.
  6. F Eteme,J Tsimi (2011). A modal -valent approach of the notion of code.
  7. Cem Güneri,Buket Özkaya,Patrick Solé (2016). Quasi-cyclic complementary dual codes.
  8. F Eteme (2009). Les énonciations composées et modales.
  9. Kristine Lally (2003). Quasicyclic Codes of Index ℓ over F q Viewed as F q[x]-Submodules of F q ℓ[x]/〈x m−1〉.
  10. F Eteme (2015). chrm introducing pure and applied mathematics.
  11. Kristine Lally,Patrick Fitzpatrick (2001). Algebraic structure of quasicyclic codes.
  12. Gabriel Cedric,Pemha Binyam,Laurence Um Emilie,Yves,Jonathan Ndje (2023). The Quadratic Character in the.
  13. J Tsimi,G Pemha (2021). On the Generalized modal -valent Reed-Muller codes.
  14. S Ling,P Solé (2001). On the algebraic structure of quasi-cyclic codes I: finite fields.
  15. F Eteme (1984). Anneau chrysippien -valent.
  16. J Tsimi,G Pemha (2021). An algorithm of Decoding of Reed-Muller codes.
  17. F Eteme (2009). Logique et Algèbre de structure mathé matiques modales -valentes chrysippiennes.
  18. J Tsimi,G Pemha (2022). A spectrum of Reed-Muller codes.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr Pemha Binyam Gabriel Cedric. 2026. \u201cQuasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p kZ, 1)\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 23 (GJSFR Volume 23 Issue F3): .

Download Citation

Almost 100 characters, so slightly adjust for clarity.
Issue Cover
GJSFR Volume 23 Issue F3
Pg. 85- 101
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
GJSFR-F Classification: DDC Code: 663.1 LCC Code: TP505
Version of record

v1.2

Issue date

May 23, 2023

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 1219
Total Downloads: 48
2026 Trends
Related Research

Published Article

The sets present an enrichment from the logical viewpoint compared with the classical sets. The subset of the invariants of a set is a classical set, which leads to the canonical construction of the structures of modal valent pseudo field. In this note the purpose is to define on a finite chain pseudo field, , the structures of Quasi-Cyclic codes of length r.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Quasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p kZ, 1)

Pemha Binyam Gabriel Cedric
Pemha Binyam Gabriel Cedric

Research Journals