In this paper, we first prove (Theorem 1) that any two inputs producing the same output in a symmetric pair of discrete skew tent maps always have the same parity, meaning that they are either both even or both odd. Building on this property, we then propose (Definition 1) a new discrete chaotic map and prove that (Theorem 2) the proposed map is a bijection for all control parameters. We further prove that (Theorem 3) the discrete Lyapunov exponent (dLE) of the proposed map is not only positive but also approaches the maximum value among all permutation maps over the integers as m gets larger. In other words, (Corollary 1) the proposed map asymptotically achieves the highest possible chaotic divergence among the permutation maps over the integers . To provide some further evidence that the proposed map is highly chaotic, we present at the end some results from the numerical experiments. We calculate the approximation and permutation entropy of the output integer sequences. We also show the NIST SP800-22 tests results and correlation properties of some derived binary sequences.
4 July 2025 in IEEE Transactions on Circuits and Systems II: Express Briefs
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.
3 January 2025 in IEEE Transactions on Information Theory
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.
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.
This paper briefly introduces the transmitter of the GNSS signal to which CSK modulation is applied, and summarizes the CSK hard/soft decision demodulation method in the corresponding receiver. Based on the summarized method, we show the hard/soft decision demodulation performance and various analyzes in an environment similar to the existing GNSS signal.