Search

In the domain of machine learning, least square twin support vector machine (LSTSVM) stands out as one of the state-of-the-art models. However, LSTSVM suffers from sensitivity to noise and outliers, overlooking the SRM principle and instability in resampling. Moreover, its computational complexity and reliance on matrix inversions hinder the efficient processing of large datasets. As a remedy to the aforementioned challenges, we propose the robust granular ball LSTSVM (GBLSTSVM). GBLSTSVM is trained using granular balls instead of original data points. The core of a granular ball is found at its center, where it encapsulates all the pertinent information of the data points within the ball of specified radius. To improve scalability and efficiency, we further introduce the large-scale GBLSTSVM (LS-GBLSTSVM), which incorporates the SRM principle through regularization terms. Experiments are performed on UCI, KEEL, and NDC benchmark datasets; both the proposed GBLSTSVM and LS-GBLSTSVM models consistently outperform the baseline models.

The classification performance of the random vector functional link (RVFL), a randomized neural network, has been widely acknowledged. However, due to its shallow learning nature, RVFL often fails to consider all the relevant information available in a dataset. Additionally, it overlooks the geometrical properties of the dataset. To address these limitations, a novel graph random vector functional link based on multi-view learning (GRVFL-MV) model is proposed. The proposed model is trained on multiple views, incorporating the concept of multiview learning (MVL), and it also incorporates the geometrical properties of all the views using the graph embedding (GE) framework. The fusion of RVFL networks, MVL, and GE framework enables our proposed model to achieve the following: i) efficient learning: by leveraging the topology of RVFL, our proposed model can efficiently capture nonlinear relationships within the multi-view data, facilitating efficient and accurate predictions; ii) comprehensive representation: fusing information from diverse perspectives enhance the proposed model's ability to capture complex patterns and relationships within the data, thereby improving the model's overall generalization performance; and iii) structural awareness: by employing the GE framework, our proposed model leverages the original data distribution of the dataset by naturally exploiting both intrinsic and penalty subspace learning criteria. The evaluation of the proposed GRVFL-MV model on various datasets, including 27 UCI and KEEL datasets, 50 datasets from Corel5k, and 45 datasets from AwA, demonstrates its superior performance compared to baseline models. These results highlight the enhanced generalization capabilities of the proposed GRVFL-MV model across a diverse range of datasets.

This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal elements and solutions of quadratic forms. It also provides a precise count of self-orthogonal elements for any duality over the finite field $\mathbb{F}_q$, particularly odd primes. Additionally, construction methods for small rank hull codes are introduced. The highest possible minimum distance among additive one-rank hull codes is denoted by $d_1[n,k]_{p^e,M}$. The value of $d_1[n,k]_{p^e,M}$ for $k=1,2$ and $n\geq 2$ with respect to any duality $M$ over any finite field $\mathbb{F}_{p^e}$ is determined. Furthermore, the new quaternary one-rank hull codes are identified over non-symmetric dualities with better parameters than symmetric ones.

Given $\mathbb{F}_{q^{n}}$, a field with $q^n$ elements, where $q $ is a prime power and $n$ is positive integer. For $r_1,r_2,m_1,m_2 \in \mathbb{N}$, $k_1,k_2 \in \mathbb{N}\cup \{0\}$, a rational function $F = \frac{F_1}{F_2}$ in $\mathbb{F}_{q}[x]$ with deg($F_i$) $\leq m_i$; $i=1,2,$ satisfying some conditions, and $a,b \in \mathbb{F}_{q}$, we construct a sufficient condition on $(q,n)$ which guarantees the existence of an $r_1$-primitive, $k_1$-normal element $\epsilon \in \mathbb{F}_{q^n}$ such that $F(\epsilon)$ is $r_2$-primitive, $k_2$-normal with $\operatorname{Tr}_{\mathbb{F}_{q^n}/\mathbb{F}_q}(\epsilon) = a$ and $\operatorname{Tr}_{\mathbb{F}_{q^n}/\mathbb{F}_q}(\epsilon^{-1}) = b$. For $m_1=10, \; m_2=11,\; r_1 = 3, \; r_2 = 2, \; k_1=2,\;k_2 = 1$, we establish bounds on $q$, for various $n$, to determine the existence of such elements in $\mathbb{F}_{q^{n}}$. Furthermore, we identify all such pairs $(q,n)$ excluding 10 possible values of $(q,n)$, in fields of characteristics 13.

The applications of additive codes mainly lie in quantum error correction and quantum computing. Due to their applications in quantum codes, additive codes have grown in importance. In addition to this, additive codes allow the implementation of a variety of dualities. The article begins by developing the properties of Additive Complementary Dual (ACD) codes with respect to arbitrary dualities over finite abelian groups. Further, we introduce a subclass of non-symmetric dualities referred to as skew-symmetric dualities. Then, we precisely count symmetric and skew-symmetric dualities over finite fields. Two conditions have been obtained: one is a necessary and sufficient condition, and the other is a necessary condition. The necessary and sufficient condition is for an additive code to be an ACD code over arbitrary dualities. The necessary condition is on the generator matrix of an ACD code over skew-symmetric dualities. We provide bounds for the highest possible minimum distance of ACD codes over skew-symmetric dualities. Finally, we find some new quaternary ACD codes over non-symmetric dualities with better parameters than the symmetric ones.

Shi et al. [Additive complementary dual codes over F4. Designs, Codes and Cryptography, 2022.] studied additive codes over the finite field F4 with respect to trace Hermitian and trace Euclidean inner products. In this article, we define additive codes of length n over finite field Fq2 as additive subgroups of Fn q2 where q is a prime power. We associate an additive code with a matrix called a generator matrix. We characterize trace Euclidean ACD and trace Hermitian ACD codes in terms of generator matrices over the finite field Fq2 . Also, we construct these codes over Fq2 from linear LCD codes over Fq., Comment: There has been major changes in this manuscript we will submit new one

Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with $deg(f_1) + deg(f_2) = n $ in $F[x]$. We construct a sufficient condition on $(p,t)$ which guarantees primitive pairing $(\epsilon, f(\epsilon))$ exists in $F$ such that $Tr_{\mathbb{F}_{p^t}/\mathbb{F}_p}(\epsilon) = a$ and $Tr_{\mathbb{F}_{p^t}/\mathbb{F}_p}(f(\epsilon)) = b$ for any prescribed $a,b \in \mathbb{F}_{p}$. Further, we demonstrate for any positive integer $n$, such a pair definitely exists for large $t$. The scenario when $n = 2$ is handled separately and we verified that such a pair exists for all $(p,t)$ except from possible 71 values of $p$. A result for the case $n=3$ is given as well.

A designated verifier signature scheme allows a signer to generate a signature that only the designated verifier can verify. This paper proposes multi-signer strong designated multi-verifier signature schemes based on multiple cryptographic algorithms and has proven their security in the random oracle model., Comment: 30 pages

A $(t,m)$-threshold secret sharing and multisecret-sharing scheme based on Shamir's SSS are introduced with two-level security using a one-way function. Besides we give its application in smart contract-enabled consortium blockchain network. The proposed scheme is thoroughly examined in terms of security and efficiency. Privacy, security, integrity, and scalability are also analyzed while applying it to the blockchain network., Comment: 16 pages