A5027802106- Coding theory and cryptography
- graph theory and CDMA systems
- Cellular Automata and Applications
- Wireless Communication Networks Research
- PAPR reduction in OFDM
- Advanced Data Storage Technologies
- Cooperative Communication and Network Coding
- Advanced Wireless Communication Techniques
- Cryptographic Implementations and Security
- Finite Group Theory Research
- Cancer Mechanisms and Therapy
- DNA and Biological Computing
- Error Correcting Code Techniques
- semigroups and automata theory
- Mathematics and Applications
- Advanced Wireless Communication Technologies
- Islamic Finance and Communication
- Mathematical Analysis and Transform Methods
- Bioactive Compounds in Plants
- Cryptography and Data Security
- Chronic Kidney Disease and Diabetes
- Mathematical Approximation and Integration
- Ultra-Wideband Communications Technology
- Advanced ceramic materials synthesis
- Inflammasome and immune disorders
Southwest Jiaotong University
2016-2025
Southern Medical University
2022-2024
Nanfang Hospital
2024
Zhujiang Hospital
2022
State Key Laboratory of Cryptology
2019-2021
Shandong University of Technology
2021
John Wiley & Sons (United States)
2020
Hudson Institute
2020
Chinese Academy of Sciences
2016-2017
Institute of Information Engineering
2016-2017
Chronic kidney disease (CKD), a involving damage to the structure and function, is global public health problem. Tubulointerstitial fibrosis (TIF) both an inevitable pathological change in individuals with CKD driving force progression of renal fibrosis. Nicotinamide N-methyltransferase (NNMT) its metabolite 1-methylnicotinamide (MNAM) have been shown protect against lipotoxicity-induced tubular injury. However, biological roles NNMT MNAM regulating TIF remain elusive. This study aimed...
Objective To collect real-world data regarding the attainment of early-achieved lupus low disease activity state (LLDAS) in systemic erythematosus (SLE) patients receiving telitacicept or belimumab treatment, and identify factors predictive target achievement. Methods Eighty-seven SLE who received (N=42) (N=45) were retrospectively reviewed this observational study. Clinical laboratory data, assessment, glucocorticoid dosage collected for analysis. Achieving LLDAS at least once within 24...
The theory of cyclotomy dates back to Gauss and has a number applications in combinatorics, coding theory, cryptography. Cyclotomy over residue class ring <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${\BBZ}_{v}$</tex></formula> can be divided into classical or generalized cyclotomy, depending on Notation="TeX">$v$</tex> </formula> prime composite. In this paper, we introduce order...
Abstract Combinatorial ‐designs have wide applications in coding theory, cryptography, communications, and statistics. It is well known that the supports of all codewords with a fixed weight code may give ‐design. In this paper, we first determine distributions class linear codes derived from dual some extended cyclic codes. We then obtain infinite families 2‐designs explicitly compute their parameters By simple counting argument, exponentially many 2‐designs.
As a class of optimal combinatorial objects, bent functions have important applications in cryptography, sequence design, and coding theory. Bent idempotents are subclass great interest, since they can be stored less space allow faster computation the Walsh-Hadamard transform. The objective this paper is to present generic construction from known ones. It includes previous constructions by Mesnager Xu et al. as special cases, produces new functions, which cannot produced earlier In...
<p style='text-indent:20px;'>Functions with good differential-uniformity properties have important applications in coding theory and sequence design addition to the cryptography. The differential spectrum of a cryptographic function is useful for estimating its resistance some variants cryptanalysis. objective this paper determine power <inline-formula><tex-math id="M1">\begin{document}$ x^{p^{2k}-p^k+1} $\end{document}</tex-math></inline-formula> over id="M2">\begin{document}$ \mathbb...
In frequency hopping (FH) communication systems, sequences (FHSs) are crucial in determining the system's anti-jamming performance. If FHSs can ensure a wide-gap between two adjacent points to avoid with high interference probability, it will significantly improve FH anti-interference ability. Moreover, if each point appears at same number of times sequence period, anti-electromagnetic be enhanced. Therefore, is desirable employ low Hamming autocorrelation, wide frequency-hopping gap, and...
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a connection between locally with multiple disjoint sets and packings is derived under condition that each set contains exactly one check symbol. Particularly, conditions which an optimal code corresponds packing also characterized. As application of connection, some can be obtained by packings. Specifically, two constructions proposed not only generalize known explicit but...
We study the Singleton-type bound that provides an upper limit on minimum distance of locally repairable codes. present improved by carefully analyzing combinatorial structure repair sets. Thus, we show previous is unachievable for certain parameters. then also provide explicit constructions optimal codes which parameters new sharp. Additionally, as a byproduct, some previously known are shown to attain and thus proved be optimal.
Spatial modulation (SM) is a special kind of multiple-input multiple-output (MIMO) technique, in which one transmit antenna activated during each symbol duration. Recently, cross Z-complementary sequence pairs (CZCPs) have been evolved as new pair to be used for pilot design SM over frequency-selective channels. CZCPs are having zero autocorrelation sums and cross-correlation within specific time-shifts. In this letter, we propose systematic constructions binary with lengths the form 2 <sup...
Subfield codes of linear over finite fields have recently received much attention since they can produce optimal codes, which may applications in secret sharing, authentication and association schemes. In this paper, we first present a construction framework 3-dimensional <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">C</i> <sub xmlns:xlink="http://www.w3.org/1999/xlink"><i>f,g</i></sub> F...
In a frequency-hopping (FH) system, to avoid that the received signal would be prone interfered, equipped FH sequence of each user should have wide gap, i.e., adjacent two frequencies some gap. this letter, we extend Lempel-Greenberger bound and Peng-Fan bounds for wide-gap sequences (WGFHSs). The proposed are tight in sense they can achieved by parameters WGFHSs.
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Difference systems of sets (DSSs) are combinatorial structures that a generalization cyclic difference and arise in connection with code synchronization. In this correspondence, we give some constructions DSS from designs get infinite classes optimal sets. </para>
The defect of an <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$[n,k,d]$ </tex-math></inline-formula> linear code is defined as notation="LaTeX">$s({\mathcal{ C}})=n-k+1-d$ . Codes with C}})=0$ are called maximum distance separable (MDS), while codes C}})=s({\mathcal{ C}}^{\perp})=1$ near (NMDS). NMDS correspond to interesting objects in finite geometry and have nice applications combinatorics...
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear two or three are constructed from quadratic Bent functions over the finite field $\gf_p$, where $p$ is an odd prime. They include some earlier as special cases. The weight distributions these also determined.