Uha Isnaini

Dr. Uha Isnaini

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2025 in Entropy
Verified
Journal Article
Open access
PDF file
AHAbdul Hadi
Abdul Hadi
UIUha Isnaini
Uha Isnaini
IWIndah Emilia Wijayanti
Indah Emilia Wijayanti
MEMartianus Frederic Ezerman
Martianus Frederic Ezerman
An even Eisenstein integer is a multiple of an Eisenstein prime of the least norm. Otherwise, an Eisenstein integer is called odd. An Eisenstein integer that is not an integer multiple of another one is said to be primitive. Such integers can be used to construct signal constellations and complex-valued codes over Eisenstein integers via a carefully designed modulo function. In this work, we establish algebraic properties of even, odd, and primitive Eisenstein integers. We investigate conditions for the set of all units in a given quotient ring of Eisenstein integers to form a cyclic group. We perform set partitioning based on the multiplicative group of the set. This generalizes the known partitioning of size a prime number congruent to 1 modulo 3 based on the multiplicative group of the Eisenstein field in the literature.

7 July 2025 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AHAbdul Hadi
Abdul Hadi
UIUha Isnaini
Uha Isnaini
IWIndah Emilia Wijayanti
Indah Emilia Wijayanti
MEMartianus Frederic Ezerman
Martianus Frederic Ezerman
We propose constructions of signal constellations over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of those over Eisenstein integer fields. By set partitioning, we effectively divide the quotient ring of Eisenstein integers into equal-sized subsets for distinct encoding. Unlike in Eisenstein integer fields where partitioning is not feasible due to structural limitations, we can partition the quotient rings into additive subgroups in such a way that the minimum squared Euclidean and hexagonal distances of each subgroup are strictly larger than in the original set. This technique facilitates multilevel coding and enhances signal constellation efficiency.

9 November 2024 in Asian-European Journal of Mathematics
Verified
Journal Article
Closed access
YWYosua Feri Wijaya
Yosua Feri Wijaya
UIUha Isnaini
Uha Isnaini
YSYeni Susanti
Yeni Susanti

8 May 2025 in Journal of Algebra Combinatorics Discrete Structures and Applications
Verified
Journal Article
Open access
PDF file
YSYeni Susanti
Yeni Susanti
ASAluysius Sutjijana
Aluysius Sutjijana
UIUha Isnaini
Uha Isnaini
ABAgista Surya Bawana
Agista Surya Bawana
CHCarolus Pasha Lazuardi Jituprasojo Hatmakelana
Carolus Pasha Lazuardi Jituprasojo Hatmakelana
This paper introduces the concept of a unit regular graph over any given ring. The unit regular graph is a simple undirected graph, where its vertices correspond to elements of the ring. Two vertices are connected if their sum results in a unit regular element within the ring. The research explores various aspects of this graph, such as completeness, vertex degrees, Eulerian and Hamiltonian properties, girth, matching number, clique number, and independence number. Furthermore, the study delves into specific properties of these graphs for certain ring types.

17 December 2025 in Forecasting
Verified
Journal Article
Open access
PDF file
Syarifah InayatiSyarifah Inayati
Syarifah Inayati
Nur IriawanNur Iriawan
Nur Iriawan
IRIrhamah
Irhamah
UIUha Isnaini
Uha Isnaini
This research tackles the challenge of forecasting nonlinear time series data with stochastic structural variations by proposing the Markov switching autoregressive model with time-varying parameters (MSAR-TVP). Although effective in modeling dynamic regime transitions, the Classical MSAR-TVP faces challenges with complex datasets. To address these issues, a Bayesian MSAR-TVP framework was developed, incorporating flexible parameters that adapt dynamically across regimes. The model was tested on two periods of U.S. real GNP data: a historically stable segment (1952–1986) and a more complex, modern segment that includes more economic volatility (1947–2024). The Bayesian MSAR-TVP demonstrated superior performance in handling complex datasets, particularly in out-of-sample forecasting, outperforming the Bayesian AR-TVP, Classical MSAR-TVP, and Classical MSAR models, as evaluated by mean absolute percentage error (MAPE) and mean absolute error (MAE). For in-sample data, the Classical MSAR-TVP retained its stability advantage. These findings highlight the Bayesian MSAR-TVP’s ability to address parameter uncertainty and adapt to data fluctuations, making it highly effective for forecasting dynamic economic cycles. Additionally, the two-year forecast underscores its practical utility in predicting economic cycles, suggesting continued expansion. This reinforces the model’s significance for economic forecasting and strategic policy formulation.

30 June 2024 in Jurnal Matematika Integratif
Verified
Journal Article
Open access
PDF file
NMNaelufa Syifna Wifaqotul Muna
Naelufa Syifna Wifaqotul Muna
UIUha Isnaini
Uha Isnaini
Suatu partisi dari bilangan bulat positif $n$ adalah barisan tak naik atas bilangan bulat positif sedemikian hingga jumlahnya adalah $n$. Frobenius memperkenalkan suatu simbol yang merepresentasikan partisi dalam bentuk matriks yang kemudian disebut simbol Frobenius. Tahun 1984, Andrews mengenalkan konsep partisi Frobenius diperumum atau F-partisi serta partisi Frobenius diperumum dengan $k$-pewarnaan. Banyaknya F-partisi dengan $k$-pewarnaan dari suatu bilangan bulat positif $n$ disebut sebagai fungsi partisi Frobenius diperumum dengan $k$-pewarnaan, dinotasikan dengan $c\phi_k (n)$. Baruah dan Salmah kemudian mengkaji F-partisi 4-pewarnaan dan memperoleh fungsi pembangkit $c\phi_4 (4n+3)$ dan kongruensi-kongruensi terkait $c\phi_4 (n)$. Dalam paper ini, ditemukan fungsi pembangkit $c\phi_4 (4n)$ dan $c\phi_4 (4n+1)$ yang melengkapi diseksi-4 dari $c\phi_4(n)$. Lebih lanjut, ditemukan pula kongruensi $c\phi_4(4n+1) \equiv 0 \pmod{16}$ yang mengakibatkan $c\phi_4 (n) \equiv 0 \pmod 4$, untuk setiap $n \not \equiv 0 \pmod 4$.