Search

Your search keyword '"Wang, Weiqiong"' showing total 49 results
Start Over Author "Wang, Weiqiong" Search Limiters Peer Reviewed
49 results on '"Wang, Weiqiong"'

1. Linear complexity over ${\mathbb{F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation

Author

Wang, Yan, Han, Xilin, Wang, Weiqiong, and Heng, Ziling

Subjects
Computer Science - Information Theory
Abstract

A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and group ring theory. The results show that the linear complexity of these sequences attains the maximum when $p\equiv \pm 1(\bmod~8)$ and is equal to {$p$+1} when $p\equiv \pm 3(\bmod~8)$ over extension field. Moreover, the 2-adic complexity of these sequences is maximum. According to Berlekamp-Massey(B-M) algorithm and the rational approximation algorithm(RAA), these sequences have quite good cryptographyic properties in the aspect of linear complexity and 2-adic complexity., Comment: 23 pages

Published
2021

5. Optimal Binary Linear Codes from Maximal Arcs

Author

Heng, Ziling, Ding, Cunsheng, and Wang, Weiqiong

Subjects
Computer Science - Information Theory
Abstract

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes with parameters $[2^{m+s}+2^s-2^m,2^{m+s}+2^s-2^m-2m-2,4]$, which have better information rates than the class of extended binary Hamming codes, and are also distance-optimal. The second objective is to construct a class of distance-optimal binary codes with parameters $[2^m+2, 2^m-2m, 6]$. Both classes of binary linear codes have new parameters.

Published
2020

6. The parameters of a family of linear codes

Author

Wang, Weiqiong and Wang, Yan

Subjects
Computer Science - Information Theory
Abstract

A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the sense that they meet certain bounds on linear codes. Applications of these codes in secret sharing schemes and combinational designs are presented., Comment: arXiv admin note: text overlap with arXiv:1607.04815 by other authors

Published
2019

10. On jumped Wenger graphs

Author

Wang, Li-Ping, Wan, Daqing, Wang, Weiqiong, and Zhou, Haiyan

Subjects
Mathematics - Combinatorics
Abstract

In this paper we introduce a new infinite class of bipartite graphs, called jumped Wenger graphs, which are closely related to Wenger graphs. An tight upper bound of the diameter and the exact girth of a jumped Wenger graph $J_m(q, i, j )$ for integers $i, j$, $1\leq i

Published
2017

21. Construction of two classes of multi-output k-rotation symmetric Boolean functions.

Author

CUI Meng, WANG Weiqiong, XU Haojie, and LIU Huanhuan

Abstract

Multi-output rotation symmetric Boolean functions with good properties play an important role in the design of cryptographic systems. Based on the action of cyclic group on the n-dimensional vector space over binary field, the sufficient conditions for the existence of multi-output k-rotation symmetric balanced and 1-resilient Boolean functions are studied by using the method of orbital partition and constructing orthogonal tables respectively. When n/k = p' (p is prime,r ∈ Z+),the range of values given for m when a balanced or 1-resilient multi-output rotational symmetric Boolean function exists. The concrete construction methods are provided and verified by Matlab. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

29. Classification of abnormal behavior in the elderly based on Wi-Fi

Author

Lin Qiang, Cao Yongchun, Wang Weiqiong, and Yifan Li

Subjects
business.industry, Computer science, Deep learning, Model parameters, Behavior recognition, Sitting, Machine learning, computer.software_genre, Running time, Support vector machine, Squatting position, Artificial intelligence, Abnormality, business, computer
Abstract

Abnormal behavior in daily life is a great threat to the health of the elderly, so it is of great significance to detect the abnormal behavior of the elderly. Using ubiquitous commercial Wi-Fi devices to collect information, behavior detection can be performed in an indoor environment without carrying other devices. The Wi-Fi based abnormal behavior detection for the elderly proposed in this paper is aimed at the fall and wandering behaviors that the elderly are prone to. At the same time, squatting and sitting behaviors those are similar to the fall behaviors are distinguished. Several classical classification models are used to compare the effect and recognition time. The experimental comparison shows that the SVM and KNN machine learning methods after adjusting the model parameters can achieve the same recognition effect as the deep learning model LSTM, shorten the running time and improve the efficiency.

Published
2021

30. Infinite families of t-designs and strongly regular graphs from punctured codes.

Author

Heng, Ziling, Li, Dexiang, Liu, Fenjin, and Wang, Weiqiong

Subjects
REGULAR graphs, STEINER systems, LINEAR codes, CYCLIC codes
Abstract

The puncturing technique is sometimes efficient in constructing projective codes from original codes which are not projective. In this paper, several families of projective linear codes punctured from reducible cyclic codes, special linear codes or irreducible cyclic codes are investigated. The parameters and weight enumerators of the punctured codes and their duals are explicitly determined. Some of the codes are optimal and some of the codes are self-orthogonal which can be used to construct quantum codes. Several infinite families of combinatorial $ 2 $-designs and $ 3 $-designs including some families of Steiner systems are constructed from the punctured codes and their duals. Besides, infinite families of strongly regular graphs are also derived from some families of two-weight projective codes. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

48. ONE SUFFICIENT AND NECESSARY CONDITION ON BALANCED BOOLEAN FUNCTIONS WITH σf = 22n + 2n+3(n ≥ 3).

Author

ZHOU, YU, WANG, LIN, WANG, WEIQIONG, DONG, XINFENG, and DU, XIAONI

Subjects
BOOLEAN functions, CRYPTOGRAPHY, SUM of squares, MATHEMATICAL bounds, MATHEMATICAL variables, AUTOCORRELATION (Statistics)
Abstract

The Global Avalanche Characteristics (including the sum-of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Son et al. (1998) gave the lower bound on the sum-of-squares indicator for a balanced Boolean function. In this paper, we give a sufficient and necessary condition on a balanced Boolean function reaching the lower bound on the sum-of-squares indicator. We also analyze whether these balanced Boolean functions exist, and if they reach the lower bounds on the sum-of-squares indicator or not. Our result implies that there does not exist a balanced Boolean function with n-variable for odd n(n ≥ 5). We conclude that there does not exist a m(m ≥ 1)-resilient function reaching the lower bound on the sum-of-squares indicator with n-variable for n ≥ 7. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results