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

Authors

  • Pemha Binyam Gabriel Cedric

ð'šÎ˜ set, ð'šÎ˜ pseudo field, chain ð'šÎ˜ pseudo field, quasi-cyclic ð'šÎ˜ codes, linear ð'šÎ˜ codes.

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.

Downloads

How to Cite

Quasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p kZ, 1). (2023). Global Journal of Science Frontier Research, 23(10), 85-101. https://www.journalofscience.org/index.php/GJSFR/article/view/103419

References

J Jensen (1985) The concatenated structure of cyclic and Abelian codes. 31(6), 788-793.

V Pless, Z Qian (1996) Cyclic codes and quadratic residue codes over. 42, 1594-1600.

A Norton, Slgean-Mandache (2000) On the structure of linear cyclic codes over finite chain rings. 10(6), 489-506.

F Eteme, J Tsimi (2011) A approach of the algebraic theory of linear codes. 14(6), 559-581.

F Eteme, J Tsimi (2011) A modal -valent approach of the notion of code. 14, 445-473.

Cem Güneri, Buket Özkaya, Patrick Solé (2016) Quasi-cyclic complementary dual codes. 42, 67-80.

F Eteme (2009) Les énonciations composées et modales. 505-594.

Kristine Lally (2003) Quasicyclic Codes of Index ℓ over F q Viewed as F q[x]-Submodules of F q ℓ[x]/〈x m−1〉. 244-253.

F Eteme (2015) chrm introducing pure and applied mathematics.

Kristine Lally, Patrick Fitzpatrick (2001) Algebraic structure of quasicyclic codes. 111(1-2), 157-175.

Gabriel Cedric, Pemha Binyam, Laurence Um Emilie, Yves, Jonathan Ndje (2023) The Quadratic Character in the. 8(1), 11-18.

J Tsimi, G Pemha (2021) On the Generalized modal -valent Reed-Muller codes.

S Ling, P Solé (2001) On the algebraic structure of quasi-cyclic codes I: finite fields. 47(7), 2751-2760.

F Eteme (1984) Anneau chrysippien -valent. 298, 1-4.

J Tsimi, G Pemha (2021) An algorithm of Decoding of Reed-Muller codes.

F Eteme (2009) Logique et Algèbre de structure mathé matiques modales -valentes chrysippiennes.

J Tsimi, G Pemha (2022) A spectrum of Reed-Muller codes. 25(6), 1791-1807.

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

Published

2023-04-03

How to Cite

Quasi-Cyclic Codes Over Finite Chain mΘ pseudo Field F(p kZ, 1). (2023). Global Journal of Science Frontier Research, 23(10), 85-101. https://www.journalofscience.org/index.php/GJSFR/article/view/103419