Guangkui Xu

Guangkui Xu

Auto-generated profile, based on publicly available information

Guangkui Xu

Anhui Jianzhu University

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1993
Verified
Conference Paper
Closed access
BSB. Suard
B. Suard
ANA.F. Naguib
A.F. Naguib
GXG. Xu
G. Xu
APA. Paulraj
A. Paulraj
The use antenna arrays in cellular code division multiple access mobile communications is studied. Techniques to localize each mobile within the cell and to generate tracking adaptive receive (and transmit) beams are addressed. The authors show that such enhancement of the CDMA system results in increased system capacity and improved robustness to power control errors. Preliminary simulation results are presented for capacity and robustness improvements for typical scenarios.

1 January 1993
Verified
Conference Paper
Closed access
LTL. Tong
L. Tong
GXG. Xu
G. Xu
TKT. Kailaith
T. Kailaith
A scheme of fast blind equalization of multipath channels using antenna arrays is proposed. An array of antennas is used along with a fractionally spaced equalization structure to combine with temporal and spatial diversities. Necessary and sufficient conditions of channel (blind) identifiability are presented. The proposed approach offers fast equalization by exploiting cyclostationary properties of the observation.<>

23 May 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GXGuangkui Xu
Guangkui Xu
LQLongjiang Qu
Longjiang Qu
Minimal linear codes are a special subclass of linear codes and have significant applications in secret sharing and secure two-party computation. In this paper, we focus on constructing minimal linear codes with wmin/wmax ≤ p–1/p for any odd prime p based on a generic construction of linear codes, where wmin and wmax denote the minimum and maximum nonzero weights in a code, respectively. First, we present two new infinite families of minimal linear codes with two or three weights by selecting suitable subcode of linear codes which are not minimal. Second, we also present an infinite family of minimal linear codes by employing partial spreads, which can be viewed as a generalization of the construction of Ding et al. In addition, we determine the weight distributions of all these minimal linear codes.

4 March 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GXGuangkui Xu
Guangkui Xu
XCXiwang Cao
Xiwang Cao
LQLongjiang Qu
Longjiang Qu
Combinatorial designs are closely related to linear codes. Recently, some near MDS codes were employed to construct $t$ -designs by Ding and Tang, which settles the question as to whether there exists an infinite family of near MDS codes holding an infinite family of $t$ -designs for $t \geq 2$ . This paper is devoted to the construction of infinite families of 3-designs and 2-designs from special equations over finite fields. First, we present an infinite family of almost MDS codes over ${\mathrm{ GF}}(p^{m})$ holding an infinite family of 3-designs. We then provide an infinite family of almost MDS codes over ${\mathrm{ GF}}(p^{m})$ holding an infinite family of 2-designs for any field ${\mathrm{ GF}}(q)$ . In particular, some of these almost MDS codes are near MDS. Second, we present an infinite family of near MDS codes over ${\mathrm{ GF}}(2^{m})$ holding an infinite family of 3-designs by considering the number of roots of a special linearized polynomial. Compared to previous constructions of 3-designs or 2-designs from linear codes, the parameters of some of our designs are new and flexible.

3 October 2015 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
GXGuangkui Xu
Guangkui Xu
XCXiwang Cao
Xiwang Cao
SXShanding Xu
Shanding Xu

20 August 2016 in Applicable Algebra in Engineering, Communication and Computing
Verified
Journal Article
Closed access
PDF file
GXGuangkui Xu
Guangkui Xu
XCXiwang Cao
Xiwang Cao
SXShanding Xu
Shanding Xu