Melola Discovery

← Melola Discovery

Jurnal Tanpa peringkat SINTA

Implementasi Aljabar Non-Asosiatif dalam pembentukkan Kode Linear Optimal pada Teori Koding

Mathematical Sciences and Applications Journal · Vol. 5 No. 2 (2025) · hlm. 71–76

DOI
10.22437/msa.v5i2.46783
ISSN
2988-6481
Terbit
2025-11-30
Penerbit
Department of Mathematics, Faculty of Science and Technology Universitas Jambi
Bahasa
en

Abstrak

This article will discuss a theorem referenced from B.T. Markov's 2012 article titled “МАТЕМАТИЧЕСКИЕ МЕТОДЫ КРИПТОГРАФИИ” (Mathematical Methods Of Cryptography). The theorem discussed provides a deep connection between non-associative algebraic structures, module theory, and optimal code construction in its application to coding theory. In this theorem, the loop algebra PL over the finite field Fq (where q = pn and is a prime number) is analyzed through module decomposition and left lattice ideals, where the loop L with order 2q - 2 contains a cyclic subgroup H with order q - 1 and each element in loop L\H satisfies three operational conditions that govern the interaction between cyclic subgroup H and loop L\H. The main result of this theorem is the construction of a code that provides optimal linear code parameters useful for detecting errors in available information. This shows that certain loop algebraic structures can produce optimal linear codes in their application to coding theory.

Kata kunci

Jaringan kolaborasi para penulis

3 penulis · 2 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Azka Aufa KhoiriAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://online-journal.unja.ac.id/index.php/msa/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Implementasi Aljabar Non-Asosiatif dalam pembentukkan Kode Linear Optimal pada Teori Koding</dc:title>
	<dc:creator xml:lang="en">Hasan, Nabila Nurmala</dc:creator>
	<dc:creator xml:lang="en">Sylviani, Sisilia</dc:creator>
	<dc:subject xml:lang="en">Loop algebra</dc:subject>
	<dc:subject xml:lang="en">Finite field</dc:subject>
	<dc:subject xml:lang="en">Lattice</dc:subject>
	<dc:subject xml:lang="en">Module theory</dc:subject>
	<dc:subject xml:lang="en">Coding theory</dc:subject>
	<dc:description xml:lang="en">This article will discuss a theorem referenced from B.T. Markov's 2012 article titled “МАТЕМАТИЧЕСКИЕ МЕТОДЫ КРИПТОГРАФИИ” (Mathematical Methods Of Cryptography). The theorem discussed provides a deep connection between non-associative algebraic structures, module theory, and optimal code construction in its application to coding theory. In this theorem, the loop algebra PL over the finite field Fq  (where q = pn and  is a prime number) is analyzed through module decomposition and left lattice ideals, where the loop L with order 2q - 2 contains a cyclic subgroup H with order q - 1 and each element in loop L\H satisfies three operational conditions that govern the interaction between cyclic subgroup H and loop L\H. The main result of this theorem is the construction of a code that provides optimal linear code parameters useful for detecting errors in available information. This shows that certain loop algebraic structures can produce optimal linear codes in their application to coding theory.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Faculty of Science and Technology Universitas Jambi</dc:publisher>
	<dc:date>2025-11-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://online-journal.unja.ac.id/msa/article/view/46783</dc:identifier>
	<dc:identifier>10.22437/msa.v5i2.46783</dc:identifier>
	<dc:source xml:lang="en">Mathematical Sciences and Applications Journal; Vol. 5 No. 2 (2025): Mathematical Sciences and Applications; 71-76</dc:source>
	<dc:source>2988-6481</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://online-journal.unja.ac.id/msa/article/view/46783/22837</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Mathematical Sciences and Applications Journal</dc:rights>
</oai_dc:dc>