SearcharxivSearch

arXiv subjects

Qiuyan Wang

Publications and source records attributed to Qiuyan Wang.

15 recordsLinked to original sources

DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation

Graph pre-training can facilitate knowledge transfer across graph datasets, but severe structural and feature shifts may cause negative transfer and adaptation-induced overwriting of reusable knowledge. We propose DIB-OD, a heterogeneous graph adaptation framework that combines a Decoupled Information Bottleneck with Online Distillation. A multiview teacher first learns a compressed, task-relevant representation, which is distilled into a transferable core branch and a complementary residual branch. Mutual-information objectives and HSIC-based dependence regularization discourage information overlap between the branches, while a confidence-aware semantic regularizer and a frozen teacher anchor reliable pretrained information during target-domain adaptation. Experiments on seven graph-classification datasets spanning chemical, biological, and social-network domains show consistent improvements over representative baselines, particularly under challenging cross-type transfer.

cs.LG

Autocorrelation of a class of quaternary sequences of period $2p^m$

Sequences with good randomness properties are quite important for stream ciphers. In this paper, a new class of quaternary sequences is constructed by using generalized cyclotomic classes of $\mathbb{Z}_{2p^m}$ $(m\geq1)$. The exact values of autocorrelation of these sequences are determined based on cyclotomic numbers of order $2$ with respect to $p^m$. Results show that the presented sequences have the autocorrelations with at most $4$ values.

cs.IT

ISHNE: Influence Self-attention for Heterogeneous Network Embedding

In recent years, Graph Neural Networks has received enormous attention from academia for its huge potential of modeling the network traits such as macrostructure and single node attributes. However, prior mainstream works mainly focus on homogeneous network and lack the capacity to characterize the network heterogeneous property. Besides, most previous literature cannot model the influence under microscope vision, making it infeasible to model the joint relation between the heterogeneity and mutual interaction within multiple relation type. In this paper, we propose an Influence Self-attention network to address the difficulties mentioned above. To model heterogeneity and mutual interaction, we redesign attention mechanism with influence factor on the single-type relation level, which learns the importance coefficient from its adjacent neighbors under the same meta-path based patterns. To incorporate the heterogeneous meta-path in a unified dimension, we developed a self-attention based framework for meta-path relation fusion according to the learned meta-path coefficient. Our experimental results demonstrate that our framework not only achieve higher results than current state-of-the-art baselines, but also show promising vision on depicting heterogeneous interactive relations under complicated network structure.

cs.SI

The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude

In 2008, a class of binary sequences of period $N=4(2^k-1)(2^k+1)$ with optimal autocorrelation magnitude has been presented by Yu and Gong based on an $m$-sequence, the perfect sequence $(0,1,1,1)$ of period $4$ and interleaving technique. In this paper, we study the 2-adic complexities of these sequences. Our results show that they are larger than $N-2\lceil\mathrm{log}_2N\rceil+4 $ (which is far larger than $N/2$) and could attain the maximum value $N$ if suitable parameters are chosen, i.e., the 2-adic complexity of this class of interleaved sequences is large enough to resist the Rational Approximation Algorithm.

cs.IT

Near MDS codes from oval polynomials

A linear code with parameters of the form $[n, k, n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n, k, n-k]$ is said to be almost MDS (i.e., almost maximum distance separable) or AMDS for short. A code is said to be near maximum distance separable (in short, near MDS or NMDS) if both the code and its dual are almost maximum distance separable. Near MDS codes correspond to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. In this paper, seven infinite families of $[2^m+1, 3, 2^m-2]$ near MDS codes over $\gf(2^m)$ and seven infinite families of $[2^m+2, 3, 2^m-1]$ near MDS codes over $\gf(2^m)$ are constructed with special oval polynomials for odd $m$. In addition, nine infinite families of optimal $[2^m+3, 3, 2^m]$ near MDS codes over $\gf(2^m)$ are constructed with oval polynomials in general.

cs.IT

Asymptotically optimal codebooks derived from generalised bent functions

Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to construct optimal codebooks. In this paper, two kinds of codebooks are presented and proved to optimally optimal with respect to the welch bound. Additionally, the constructed codebooks in this paper have new parameters.

cs.IT

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of $p$-ary $m$-Sequence

LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encryption Standard. Therefore, analyzing the statistical properties (for example, autocorrelation, linear complexity and 2-adic complexity) of these sequences becomes an important research topic. In this paper, we first reduce the autocorrelation distribution of the LSB sequence of a $p$-ary $m$-sequence with period $p^n-1$ for any order $n\geq2$ to the autocorrelation distribution of a corresponding Costas sequence with period $p-1$, and from the computing of which by computer, we obtain the explicit autocorrelation distribution of the LSB sequence for each prime $p<100$. In addition, we give a lower bound on the 2-adic complexity of each of these LSB sequences for all primes $p < 20$, which proves to be large enough to resist the analysis of RAA (Rational Approximation Algorithm) for FCSRs (Feedback with Carry Shift Registers). In particular, for a Mersenne prime $p=2^k-1$ (i.e., $k$ is a prime such that $p$ is also a prime), our results hold for all its bit-component sequences since they are shift equivalent to the LSB sequence.

cs.IT

Multisequences with high joint nonlinear complexity from function fields

Multisequences over finite fields play a pushing role in the applications that relate to parallelization, such as word-based stream ciphers and pseudorandom vector generation. It is interesting to study the complexity measures for multisequences. In this paper, we propose three constructions of multisequences over finite fields from rational function fields and Hermitian function fields. We also analyze the joint nonlinear complexity of these multisequences. Moreover, the length and dimension of these multisequences are flexible.

cs.IT

On the $k$-error linear complexity of binary sequences derived from the discrete logarithm in finite fields

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $σ=(σ_0,σ_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $χ$ of the finite field $\mathbb{F}_q$: $$ σ_n=\left\{ \begin{array}{ll} 0,& \mathrm{if}\quad n= 0,\\ (1-χ(ξ_n))/2,&\mathrm{if}\quad 1\leq n< q, \end{array} \right. $$ for the ordered elements $ξ_0,ξ_1,\ldots,ξ_{q-1}\in \mathbb{F}_q$. The $σ$ is Legendre sequence if $r=1$. Our first contribution is to prove a lower bound on the linear complexity of $σ$ for $r\geq 2$. The bound improves some results of Meidl and Winterhof. Our second contribution is to study the $k$-error linear complexity of $σ$ for $r=2$. It seems that we cannot settle the case when $r>2$ and leave it open.

cs.CR

A family of linear codes with three weights

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three weights.

cs.IT

Binary linear codes with at most 4 weights

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used in secret sharing schemes.

cs.IT

A Class of Linear Codes With Three Weights

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp are constructed. The weight distributions of the linear codes are settled. These codes have applications in authentication codes, association schemes and data storage systems.

cs.IT

Complete weight enumerators of two classes of linear codes

Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications in secret sharing schemes.

cs.IT

A class of three-weight and five-weight linear codes

Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear codes over Fp, where p is an odd prime and Fp denotes a finite field with p elements. The weight distributions of the linear codes constructed in this paper are also settled. Moreover, the linear codes illustrated in the paper may have applications in secret sharing schemes.

cs.IT