Department of Informatics
Recent Submissions
-
Construction of spectrally-null-constrained zero-correlation zone sequences with flexible support
(Journal article; Peer reviewed, 2024)In recent years, zero-correlation zone (ZCZ) sequences have been studied due to their significant applications in quasi-synchronous code division multiple access (QS-CDMA) systems and other wireless communication domains. ... -
Investigation of the permutation and linear codes from the Welch APN function
(Journal article; Peer reviewed, 2024)Dobbertin in 1999 proved that the Welch power function \(x^{2^m+3}\) was almost perferct nonlinear (APN) over the finite field \(\mathbb {F}_{2^{2m+1}}\), where m is a positive integer. In his proof, Dobbertin showed that ... -
Bivariate functions with low c-differential uniformity
(Journal article; Peer reviewed, 2024)Starting with the multiplication of elements in F2 q which is consistent with that over Fq2 , where q is a prime power, via some identification of the two environ- ments, we investigate the c-differential uniformity for ... -
Novel Power-Imbalanced Dense Codebooks for Reliable Multiplexing in Nakagami Channels
(Journal article; Peer reviewed, 2024)This letter studies enhanced dense code multiple access (DCMA) system design for downlink transmission over the Nakagami- m fading channels. By studying the DCMA pairwise error probability (PEP) in a Nakagami- m channel, ... -
Further investigation on differential properties of the generalized Ness–Helleseth function
(Journal article; Peer reviewed, 2024)Let n be an odd positive integer, p be an odd prime with \(p\equiv 3\pmod 4\), \(d_{1} = {{p^{n}-1}\over {2}} -1 \) and \(d_{2} =p^{n}-2\). The function defined by \(f_u(x)=ux^{d_{1}}+x^{d_{2}}\) is called the generalized ... -
Generalized Low-Rank Parity-Check Codes
(Journal article; Peer reviewed, 2024)Let Fq be the finite field with q elements and m be a positive integer. The Fqm -linear low-rank parity-check (LRPC) codes have been used in many cryptographic schemes. Motivated by recent attacks on those schemes, this ... -
New Correlation Bound and Construction of Quasi-Complementary Sequence Sets
(Journal article; Peer reviewed, 2024)Quasi-complementary sequence sets (QCSSs) have attracted sustained research interests for simultaneously supporting more active users in multi-carrier code-division multiple-access (MC-CDMA) systems compared to complete ... -
More Differential Properties of the Ness-Helleseth Function
(Journal article; Peer reviewed, 2024)Let n≥3 be an odd integer, d1=3n−12−1 , d2=3n−2 and u be an element of the finite field F3n . This paper shows that fu(x)=uxd1+xd2 is an almost perfect nonlinear (APN) function on F3n if and only if χ(u+1)=χ(u−1)=χ(u) , ... -
XAI for Time Series Classification: Evaluating the Benefits of Model Inspection for End-Users
(Chapter, 2024)We present an XAI tool for time series classification providing model-agnostic instance-based post-hoc explanations, by means of prototypes and counterfactuals. Additionally, our tool allows for model inspection on instances ... -
On a Combinatorial Problem Arising in Machine Teaching
(Journal article; Peer reviewed, 2024)We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any ... -
End Super Dominating Sets in Graphs
(Journal article; Peer reviewed, 2025)Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted ... -
Two New Infinite Families of APN Functions in Trivariate Form
(Journal article; Peer reviewed, 2024)We present two infinite families of APN functions in trivariate form over finite fields of the form F23m . We show that the functions from both families are permutations when m is odd, and are 3-to-1 functions when m is ... -
An integrated RNA-proteomic landscape of drug induced senescence in a cancer cell line
(Journal article; Peer reviewed, 2023)Background: Senescent cells are characterized by an arrest in proliferation. In addition to replicative senescence resulting from telomere exhaustion, sub-lethal genotoxic stress resulting from DNA damage, oncogene activation ... -
The Nordic Prior Knowledge Test in Programming: Motivation, Development and Preliminary Results
(Journal article; Peer reviewed, 2024)With recent updates to Norway's national curriculum, computational thinking and programming has become a core part of the K-12 education, leading to an influx of students entering higher education with prior programming ... -
Causally Abstracted Multi-armed Bandits
(Journal article; Peer reviewed, 2024)Multi-armed bandits (MAB) and causal MABs (CMAB) are established frameworks for decision-making problems. The majority of prior work typically studies and solves individual MAB and CMAB in isolation for a given problem and ... -
Fair Soft Clustering
(Journal article; Peer reviewed, 2024)Scholars in the machine learning community have recently focused on analyzing the fairness of learning models, including clustering algorithms. In this work we study fair clustering in a probabilistic (soft) setting, where ... -
A research data management (RDM) community for ELIXIR
(Journal article; Peer reviewed, 2024)Research data management (RDM) is central to the implementation of the FAIR (Findable Accessible, Interoperable, Reusable) and Open Science principles. Recognising the importance of RDM, ELIXIR Platforms and Nodes have ... -
Development of a high dimensional imaging mass cytometry panel to investigate spatial organization of tissue microenvironment in formalin-fixed archival clinical tissues
(Journal article; Peer reviewed, 2024)To decipher the interactions between various components of the tumor microenvironment (TME) and tumor cells in a preserved spatial context, a multiparametric approach is essential. In this pursuit, imaging mass cytometry ... -
Structural perspective on constraint-based learning of Markov networks
(Journal article; Peer reviewed, 2024)Markov networks are probabilistic graphical models that employ undirected graphs to depict conditional independence relationships among variables. Our focus lies in constraint-based structure learning, which entails learning ... -
Time–Approximation Trade-Offs for Learning Bayesian Networks
(Journal article; Peer reviewed, 2024)Bayesian network structure learning is an NP-hard problem. Furthermore, the problem remains hard even for various subclasses of graphs. Motivated by the hardness of exact learning, we study approximation algorithms for ...
RSS 2.0