Hong-Yeop Song

This paper proposes semantic interference cancellation (SemantIC)-Mamba, a novel framework that enhances semantic reconstruction accuracy while stably maintaining channel decoding performance. The proposed model follows a turbo structure in which information is complementarily exchanged between the semantic domain and the signal domain, progressively refining the reconstruction quality through iterative processing. To effectively perform this iterative information refinement, the proposed framework adopts a semantic autoencoder composed of three key components: a Conv block that extracts local features, a Mamba block that efficiently models long-range dependencies to integrate global contextual information, and an UpConv block that restores low-resolution features to the original resolution. Experimental results demonstrate that SemantIC-Mamba consistently achieves improved PSNR and classification accuracy compared to conventional SemantIC and SemantIC++ while maintaining channel decoding performance at a level comparable to existing models.

This paper develops the theory and constructions of polyphase zero-ambiguity-zone (ZAZ) sequences for ISAC waveforms, enabling the ZAZ shape to be designed over delay–Doppler regions of interest and supporting flexible (including multi-mode) sensing–communication operation. We first prove that a polyphase sequence with an optimal rectangular auto-ZAZ must be a member of some uncorrelated optimal ZCZ sequence family, and conversely, any member of an uncorrelated optimal ZCZ sequence family has an optimal rectangular auto-ZAZ. We generalize the optimality condition on the rectangular ZAZ to that on centrally symmetric convex ZAZs in general. We propose some constructions of families of polyphase sequences with a strictly or asymptotically optimal rectangular ZAZ, and asymptotically optimal rhombic or hexagonal ZAZ from the flexible ZAZ configuration.

This paper proposes MixBinNet, a neural network‐based model that generates binary sequences with low autocorrelation sidelobes and low cross‐correlation while maintaining a balanced bit distribution. Conventional sequence design methods lack flexibility in sequence length and set size, while often failing to jointly optimize correlation and balance properties. To overcome these limitations, MixBinNet employs an embedding block for diverse initialization, intra‐ and inter‐mixing blocks that learn local and global correlation patterns and a binarization block for converting real‐valued outputs into binary sequences. In addition, we design custom loss functions that enable the joint optimization of autocorrelation sidelobes, cross‐correlation and balanced bit distributions during training. Experimental results show that MixBinNet consistently outperforms existing chaotic map‐based methods in terms of autocorrelation and cross‐correlation, while maintaining a bit distribution close to the ideal ratio of 0.5. These results demonstrate the effectiveness of MixBinNet in generating high‐quality binary sequence sets.

In this brief, we investigate the chaotic characteristics of the integer sequences generated by primitive linear feedback shift registers (LFSRs) by interpreting the internal states as integers. We prove that the discrete Lyapunov exponent (dLE) of the permutations induced by these sequences from an L-stage primitive LFSR approches to the range between $\ln (\sqrt {3})$ and $\ln (2)$ as L increases indefinitely and hence the dynamic systems satisfy the definition of discrete chaos. Furthermore, the 0–1 test of the sequences yields statistics close to 1, supporting the conclusion that these sequences exhibit chaotic dynamics under both theoretical and empirical evaluations.

In this paper, we propose a simple construction for binary $(n,k)$ linear codes using s-mark Golomb rulers. We prove that these codes are sequential-recovery locally repairable codes (LRCs) with availability 2, which can sequentially recover 5 erased symbols. We prove the necessary and sufficient condition for the proposed codes to be rate-optimal. We also prove the necessary and sufficient condition for the proposed codes to be dimension-optimal. Finally, we propose some variations of this constructions to obtain some 5-sequential recovery LRCs with availability 3. The proposed codes have higher rates and have more flexible choice for the lengths than other previously reported constructions.