Searcharxiv⌕ Search

arXiv subjects

Zhengchun Zhou

Publications and source records attributed to Zhengchun Zhou.

At least 19 recordsLinked to original sources

From Concepts to Interactions: Dynamic Graph Semantic Recomposition for Safe Visual Generation

Recent advances in flow-matching Transformers have greatly improved Text-to-Image (T2I) and Text-to-Video (T2V) generation, but unconstrained generation risks producing illegal or unethical content. Safety alignment must therefore suppress unsafe content while preserving legitimate generation. A concept's safety depends on context: a knife used for cooking is safe, whereas its use in violence is harmful. Yet most concept erasure methods indiscriminately suppress static, isolated representations, overlooking evolving semantic interactions. Consequently, safe scenes containing potentially sensitive terms may be unintentionally suppressed, compromising generation quality. To address this, we propose Dynamic Graph Semantic Recomposition (DGSR), which dynamically constructs and updates a semantic interaction graph from evolving text visual states during sampling. Context aware graph reasoning captures semantic dependencies, while paired safe/unsafe supervision distinguishes harmful from legitimate interactions, enabling precise identification of and selective intervention on high risk semantic relationships while preserving benign semantics. DGSR freezes the pretrained backbone and supports both image and video generation. Experiments show that DGSR achieves the lowest Attack Success Rate (ASR) in 10 of 12 T2I evaluations and reduces the average T2V unsafe frame rate by 41.2\% relative to the strongest baseline, while maintaining high generation fidelity and temporal consistency.

cs.CV↗

GRACE: Adaptive Concept Erasure with Geometry-Guided Retention in Diffusion Models

Text-to-image (T2I) diffusion models inevitably internalize sensitive or non-compliant concepts from large-scale pretraining data, necessitating post-hoc concept erasure. However, existing erasure methods often lack explicit constraints on parameter updates, leading to over-intervention and unintended semantic drift. In addition, many methods rely on manually crafted counterfactual supervision, such as surrogate prompts, which incurs substantial data construction costs that limit scalability to new concepts. To address these limitations, we propose GRACE, a structured concept erasure framework designed to enable localized and selective intervention. Specifically, we introduce a semantically weighted sensitive subspace estimation to precisely lock intervention directions, and employ lightweight subspace-constrained adapters to prevent global semantic disturbance. To eliminate the dependency on manual prompt engineering, we design an automatically decoupled safe-anchor mechanism. To mitigate semantic drift induced by excessive intervention, we introduce an energy-driven dynamic gating mechanism that adaptively controls the timing and strength of intervention at inference. Extensive experiments demonstrate that our method achieves a superior balance between erasure effectiveness and generation fidelity. Compared with the average performance of five state-of-the-art (SOTA) concept erasure methods, our method improves the fine-grained NSFW reduction rate by $17.86\%$, while reducing the macro-averaged target CLIP Score and preservation-oriented Fréchet Inception Distance (FID) by $4.55\%$ and $52.14\%$, indicating stronger concept suppression with substantially improved preservation of the original model's generative utility.

cs.CV↗

The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels

The binary asymmetric channel is a model for practical communication systems where the error probabilities for symbol transitions $0\rightarrow 1$ and $1\rightarrow0$ differ substantially. In this paper, we introduce the notion of asymmetric Hamming bidistance (AHB) and its two-dimensional distribution, which separately captures directional discrepancies between codewords. This finer characterization enables a more discriminative analysis of decoding the error probabilities for maximum-likelihood decoding (MLD), particularly when conventional measures, such as weight distributions and existing discrepancy-based bounds, fail to distinguish code performance. Building on this concept, we derive a new upper bound on the average error probability for binary codes under MLD and show that, in general, it is incomparable with the two existing bounds derived by Cotardo and Ravagnani (IEEE Trans. Inf. Theory, 68 (5), 2022). To demonstrate its applicability, we compute the complete AHB distributions for several families of codes, including two-weight and three-weight projective codes (with the zero codeword removed) via strongly regular graphs and 3-class association schemes, as well as nonlinear codes constructed from symmetric balanced incomplete block designs (SBIBDs).

cs.IT↗

Explicit Constructions of Maximum-Cardinality Families of Plateaued Functions with Pairwise Disjoint Walsh Supports

Families of plateaued Boolean functions with pairwise disjoint Walsh supports are useful in secondary constructions of cryptographic Boolean functions. Of particular interest are maximum-cardinality families whose members admit no nonzero linear structures. To the best of our knowledge, the previously known general construction attaining both properties is spectral (Hodžić et al., IEEE Trans. Inf. Theory 65(9): 5865--5879, 2019). In that work, explicit algebraic normal forms are not generally provided, and no general method is established for prescribing a common algebraic degree for all family members. In this paper, we present two new explicit algebraic constructions within a unified framework, one based on linear functions and the other on partially linear functions with bent components. Let $p\geq 2$ and $q\geq 0$ satisfy $q<2^p-p-1$, and set $m=p+q$. Both constructions yield maximum-cardinality families of $2^{q+1}$ $(q+1)$-plateaued Boolean functions with pairwise disjoint Walsh supports. No member admits a nonzero linear structure, and every member has an explicit generalized Maiorana--McFarland representation. The first construction produces functions in $m+p+1$ variables and realizes any prescribed common algebraic degree $3\leq d\leq p+1$, provided that $q<\sum_{i=2}^{d-1}\binom{p}{i}$; its maximum attainable degree $p+1$ is optimal. The second construction produces functions in $n+p+1$ variables, where $n>m$ and $n-m$ is even, and realizes any prescribed common algebraic degree $3\leq d\leq p+(n-m)/2$, provided that $q<\sum_{i=2}^{\min\{d-1,p\}}\binom{p}{i}$; its maximum attainable degree $p+(n-m)/2$ is next-to-optimal.

cs.IT↗

DSS: Dynamic Semantic Steering for Robust Concept Erasure in Diffusion Models

Text-to-image (T2I) diffusion models have introduced new security risks, as adversaries can exploit flexible text prompts to induce the generation of sensitive or policy-violating content (e.g., NSFW or copyrighted concepts). Concept erasure has emerged as a promising defense, aiming to suppress targeted semantics while preserving benign generation. However, existing approaches face a fundamental trade-off: training-based methods are costly and inflexible to emerging threats, while inference-time interventions often rely on unconstrained feature manipulation, leading to over-correction, semantic drift, and degraded utility. More critically, they lack an explicit understanding of local semantic structure, resulting in unstable behavior under adversarial or compositional prompts. In this paper, we propose Dynamic Semantic Steering (DSS), a training-free, inference-time defense framework for robust and controllable concept erasure under prompt-level adversarial settings. DSS introduces a geometry-aware formulation that explicitly models local semantic neighborhoods and constrains feature updates within this structure, which is key to achieving precise suppression without sacrificing benign semantics. Specifically, DSS (i) automatically identifies benign semantic anchors via density-based boundary modeling, and (ii) performs context-aware, constrained feature correction using cross-attention signals with a closed-form solution. Extensive experiments demonstrate that DSS achieves strong and consistent suppression across diverse concept categories and adversarial prompts, reaching an average erasure rate of 91.0\%, outperforming prior defenses (18.6\%--85.9\%). At the same time, DSS substantially reduces semantic drift and preserves generation fidelity.

cs.CV↗

Gaussian Core LoRA: Distribution-Aware Dynamic Adaptation for Broad Concept Erasure

Concept erasure aims to suppress unsafe, privacy-sensitive, or undesirable generations in text-to-image diffusion models while preserving benign semantics, visual quality, and deployment efficiency. Existing adapter-based methods, such as Low-Rank Adaptation (LoRA), typically freeze the diffusion backbone and learn lightweight parameter updates to steer generation away from target semantics. However, these methods usually assign a static semantic erasure direction to each target concept. This assumption is overly coarse for broad and complex target concepts, since a concept often contains multiple latent semantic prototypes involving different objects, scenes, or relations, and requires different local erasure directions. A single LoRA update averages these heterogeneous erasure demands, leading to under-erasure on difficult prototypes and over-editing of nearby benign semantics. To address this limitation, we propose Gaussian Core LoRA, a distribution-aware low-rank adaptation framework. It fits a Gaussian mixture model in the prompt feature space to estimate latent semantic prototypes within the target concept. During inference, each input prompt is projected into this feature space to compute its Gaussian posterior responsibilities, which condition the core generator to produce a prompt-specific, norm-bounded residual reconfiguration of the shared LoRA rank space. This enables prototype-adaptive erasure with a single lightweight adapter. Compared with the strongest baseline on each metric, Gaussian Core LoRA reduces average Attack Success Rate (ASR) by 7.95%, lowers COCO Fr'echet Inception Distance (FID) by 14.72%, and improves CLIP Score by 4.98%. Further experiments show robustness to adversarial prompts, scalability to multi-identity and multi-style erasure, and compatibility with SDXL and FLUX.

cs.CV↗

Security in Low-Altitude ISAC with Coupled Communication and Sensing Information Leakage

Secure information transmission in integrated sensing and communication (ISAC) systems deployed in low-altitude wireless networks (LAWN) is particularly challenging due to the open airspace and the broadcast nature of wireless signals reused for both communication and sensing, which give rise to more severe and complex security threats. This paper investigates the joint communication and sensing security of low-altitude ISAC systems where a communication eavesdropper (CEve) cooperates with and assists a sensing eavesdropper (SEve), leading to coupled communication and sensing information leakage. We define a recoverable signal power ratio (RSR) that quantifies the degree of coupling between communication eavesdropping and sensing information leakage. Based on this coupling, we formulate a joint eavesdropping mutual information (MI) that facilitates unified analysis and optimization for the overall security. Subsequently, we design the transmit beamformer that maximizes the weighted sum of legitimate communication and sensing MI under the joint information-leakage constraint. Simulations show that the proposed scheme converges rapidly and effectively exploits the coupling between communication eavesdropping capability and sensing information leakage.

eess.SP↗

When Do Subset Sums in Finite Abelian Groups Support $2$-Designs?

Subset sums over finite abelian groups lie at the intersection of additive combinatorics, design theory, and coding theory. Let $G$ be a finite abelian group, and let $\cB_k^x$ be the family of $k$-subsets of $G$ whose elements sum to $x\in G$. This paper studies when the incidence structure $(G,\cB_k^x)$ is a block design. The elementary abelian $p$-group case was settled by Falcone and Pavone. Pavone (\emph{Des. Codes Cryptogr.} 91 (2023), 2585--2603) further asked whether, for an arbitrary finite abelian group $G$, the zero-sum incidence structure $(G,\cB_k^0)$ can be a nontrivial $2$-design only when $G$ is an elementary abelian $p$-group. We settle this open question in the stronger form that, for every $x\in G$, $(G,\cB_k^x)$ can be a nontrivial $2$-design only if $G$ is an elementary abelian $p$-group. The proof develops a character-theoretic approach to subset-sum designs, using character sums over the blocks to constrain the structure of the character group $\widehat G$. The approach also yields a complete characterization of subset-sum $1$-designs and general arithmetic restrictions on subset-sum designs over arbitrary finite abelian groups, extending the corresponding results previously known for finite abelian $p$-groups.

math.CO↗

Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes

The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics, and coding theory. In the realm of sequence design, maximum-length sequences (m-sequences) are among the most fundamental classes of sequences, traditionally characterized by their span, decimation, shift-and-add, balance, run, and ideal autocorrelation properties. In this paper, we bridge the two foundational concepts by uncovering novel structural features of m-sequences through the lens of a family of Gram matrices. Specifically, for each $1 \le t \le 2^n - 1$, we extract $n$ consecutive subsequences of length $t$ from an m-sequence of period $2^n - 1$, construct their corresponding $n \times n$ Gram matrix, and investigate its rank, denoted by $r_n(t)$. Utilizing semilinear representation of Galois groups and Bézoutian of polynomials, we derive an explicit formula for $r_n(t)$ for all $t$, thereby establishing the complete rank distribution of these Gram matrices. Notably, we prove that full rank is attained for approximately half of the admissible values of $t$. We further uncover the intricate dynamics of $r_n(t)$: rank-deficient states are strictly unstable (i.e., $r_n(t) < n$ implies $r_n(t+1) \ne r_n(t)$), whereas the full-rank state exhibits strong persistence, remaining at $n$ over a nontrivial interval of consecutive values of $t$. Altogether, our results fully characterize both the global rank distribution and the local dynamics of rank function, as invariant of m-sequences. As an application, our findings completely determine the hull distribution of the family of punctured cyclic simplex codes.

cs.IT↗

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes supporting combinatorial $t$-designs have attracted growing interest, yet constructing such codes remains highly challenging. In 2020, Ding and Tang initiated the study of NMDS codes supporting 2-designs by constructing the first infinite family, followed by several other constructions for $t > 2$, all with length at most $q + 1$. Although NMDS codes can, in principle, exceed this length, known examples supporting 2-designs and having length greater than $q + 1$ are extremely rare and limited to a few sporadic binary and ternary cases. In this paper, we present the first \emph{generic construction} of $q$-ary NMDS codes supporting 2-designs with lengths \emph{exceeding $q + 1$}. Our method leverages new connections between elliptic curve codes, finite abelian groups, subset sums, and combinatorial designs, resulting in an infinite family of such codes along with their weight distributions.

math.CO↗

Non-GRS type Euclidean and Hermitian LCD codes and Their Applications for EAQECCs

In recent years, the construction of non-GRS type linear codes has attracted considerable attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and the Wieschebrink attack. Constructing linear complementary dual (LCD) codes and determining the hull of linear codes have long been important topics in coding theory, as they play the crucial role in constructing entanglement-assisted quantum error-correcting codes (EAQECCs), certain communication systems and cryptography. In this paper, by utilizing a class of non-GRS type linear codes, namely, generalized Roth-Lempel (in short, GRL) codes, we firstly construct several classes of Euclidean LCD codes, Hermitian LCD codes, and linear codes with small-dimensional hulls, generalized the main results given by Wu et al. in 2021. We also present an upper bound for the number of a class of Euclidean GRL codes with 1-dimensional hull, and then for several classes of Hermitian GRL codes, we firstly derive an upper bound for the dimension of the hull, and prove that the bound is attainable. Secondly, as an application, we obtain several families of EAQECCs. Thirdly, we prove that the GRL code is non-GRS for $k >\ell$. Finally, some corresponding examples for LCD MDS codes and LCD NMDS codes are presented.

cs.IT↗

Matched Filtering-Based Channel Estimation for AFDM Systems in Doubly Selective Channels

Affine frequency division multiplexing (AFDM) has recently emerged as an excellent backward-compatible 6G waveform. In this paper, we study matched filtering (MF) assisted channel estimation (CE) for AFDM systems in complex doubly selective channels. By deriving the complete input-output relationship of the continuous-time signal, the inter-chirp-carrier interference, signal-to-interference-plus-noise ratio (SINR), and the effective SINR loss of AFDM, are investigated in discrete affine Fourier transform (DAFT) domain. Further, we propose two low-complexity methods for constructing the channel matrix by taking advantage of its inherent discrete Fourier transform structure and the staircase structure of the piecewise functions in the channel matrix, respectively. It is shown that complexity reduction by at least two orders of magnitude can be achieved for a large number of chirp subcarriers. For the CE problem in doubly selective channels, we introduce an MF assisted CE scheme. This allows us to sequentially estimate the parameters of each path by exploiting the separability and approximate orthogonality of different paths in the DAFT domain, thus leading to significantly reduced complexity. Furthermore, based on generalized Fibonacci search (GFS), an MF-GFS scheme is proposed to avoid significantly redundant computation, which can be extended to typical wide-band systems. Extensive simulation results indicate that the proposed schemes offer superior advantages in terms of their improved communication performance and lower complexity.

eess.SP↗

Orthogonal Chirp Delay-Doppler Division Multiplexing (CDDM) Modulation for High Mobility Communications

This paper proposes a novel multi-carrier modulation framework for high-mobility communication scenarios. Our key idea lies in spreading data symbols across the delay-Doppler (DD) domain through orthogonal chirp-Zak transform (CZT). To enable efficient signal multiplexing, the proposed modulation scheme employs a transmitter signal that maintains orthogonality with the inherent resolution characteristics of the DD plane. Termed as Orthogonal Chirp Delay-Doppler Division Multiplexing (CDDM), we demonstrate a synergistic integration of chirp waveform properties with the channel structure of the DD domain, thereby achieving advantages with both lower computational efficiency and improved detection performance. We introduce a novel CZT-based superimposed sparse pilot structure to enable simultaneous estimation of delay-Doppler shifts and channel coefficients. For enhanced performance, we further develop an embedded pilot scheme that demonstrates channel estimation performance comparable to that of Orthogonal Delay-Doppler Division Multiplexing (ODDM) systems. Simulation results demonstrate that CDDM achieves significant bit error rate (BER) improvements over existing modulation schemes , under perfect channel state information (CSI), as well as superior out-of-band emissions (OOBE). Further, for the imperfect CSI case, the proposed CZT-based superimposed pilot scheme leads to significantly reduced normalized mean square error (NMSE), whilst attaining equivalent estimation accuracy to that of ODDM with lower computational complexity.

eess.SP↗

Some Optimal and Near Optimal Doppler Resilient Complementary Sequence Sets

Sequences with excellent ambiguity functions are very useful in radar detection and modern mobile communications. Doppler resilient complementary sequence (DRCS) is a new type of sequence proposed recently, which can achieve lower ambiguity function sidelobes by summing the ambiguity functions of subsequences. In this paper, we introduce some new constructions of DRCS sets (DRCSSs) based on one-coincidence frequency-hopping sequence sets (OC-FHSSs), almost difference sets (ADSs), some specific sequences, etc. Critically, the proposed DRCSSs are optimal or near optimal.

cs.IT↗

Doppler Resilient Complementary Sequences: Tighter Aperiodic Ambiguity Function Bound and Optimal Constructions

Doppler-resilient complementary sequence sets (DRCSs) are crucial in modern communication and sensing systems in mobile environments. In this paper, we propose a new lower bound for the aperiodic ambiguity function (AF) of unimodular DRCSs based on weight vectors, which generalizes the existing bound as a special case. The proposed lower bound is tighter than the Shen-Yang-Zhou-Liu-Fan bound. Finally, we propose a novel class of aperiodic DRCSs with small alphabets based on quasi-Florentine rectangles and Butson-type Hadamard matrices. Interestingly, the proposed DRCSs asymptotically satisfy the proposed bound.

cs.IT↗

On Definite Iterated Belief Revision with Belief Algebras

Traditional logic-based belief revision research focuses on designing rules to constrain the behavior of revision operators. Frameworks have been proposed to characterize iterated revision rules, but they are often too loose, leading to multiple revision operators that all satisfy the rules under the same belief condition. In many practical applications, such as safety critical ones, it is important to specify a definite revision operator to enable agents to iteratively revise their beliefs in a deterministic way. In this paper, we propose a novel framework for iterated belief revision by characterizing belief information through preference relations. Semantically, both beliefs and new evidence are represented as belief algebras, which provide a rich and expressive foundation for belief revision. Building on traditional revision rules, we introduce additional postulates for revision with belief algebra, including an upper-bound constraint on the outcomes of revision. We prove that the revision result is uniquely determined given the current belief state and new evidence. Furthermore, to make the framework more useful in practice, we develop a particular algorithm for performing the proposed revision process. We argue that this approach may offer a more predictable and principled method for belief revision, making it suitable for real-world applications.

cs.AI↗

Waveform and Filter Design for Integrated Sensing and Communication Against Signal-dependent Modulated Jamming

This paper focuses on an integrated sensing and communication (ISAC) system in the presence of signal-dependent modulated jamming (SDMJ). Our goal is to suppress jamming while carrying out simultaneous communications and sensing. We minimize the integrated sidelobe level (ISL) of the mismatch filter output for the transmitted waveform and the integrated level (IL) of the mismatch filter output for the jamming, under the constraints of the loss in-processing gain (LPG) and the peak-to-average power ratio (PAPR) of the transmitted waveform. Meanwhile, the similarity constraint is introduced for information-bearing transmit waveform. We develop a decoupled majorization minimization (DMM) algorithm to solve the proposed multi-constrained optimization problem. In contrast to the existing approaches, the proposed algorithm transforms the difficult optimization problem involving two variables into two parallel sub-problems with one variable, thus significantly speeding up the convergence rate. Furthermore, fast Fourier transform (FFT) is introduced to compute the closed-form solution of each sub-problem, giving rise to a greatly reduced computation complexity. Simulation results demonstrate the capabilities of the proposed ISAC system which strikes a proper trade-off among sensing and jamming suppression.

eess.SP↗

Joint Beamforming Design for Integrated Sensing and Communication Systems with Hybrid-Colluding Eavesdroppers

In this paper, we consider the physical layer security (PLS) problem for integrated sensing and communication (ISAC) systems in the presence of hybrid-colluding eavesdroppers, where an active eavesdropper (AE) and a passive eavesdropper (PE) collude to intercept the confidential information. To ensure the accuracy of sensing while preventing the eavesdropping, a base station transmits a signal consisting of information symbols and sensing waveform, in which the sensing waveform can be also used as artificial noise to interfere with eavesdroppers. Under this setup, we propose an alternating optimization-based two stage scheme (AO-TSS) for improving the sensing and communication performance. In the first stage, based on the assumptions that the perfect channel state information (CSI) of the AE and statistical CSI of the PE are known, the communication and sensing beamforming problem is formulated with the objective of minimizing the weighted sum of the beampattern matching mean squared error (MSE) and cross-correlation, subject to the secure transmission constraint. To tackle the non-convexity, we propose a semi-definite relaxation (SDR) algorithm and a reduced-complexity zero-forcing (ZF) algorithm. Then, the scenarios are further extended to more general cases with imperfect AE CSI and unknown PE CSI. To further improve the communication performance, the second-stage problem is developed to optimize the secrecy rate threshold under the radar performance constraint. Finally, numerical results demonstrate the superiority of the proposed scheme in terms of sensing and secure communication.

eess.SY↗