Maosheng Xiong

Maosheng Xiong

Auto-generated profile, based on publicly available information

Maosheng Xiong

The Hong Kong University of Science and Technology

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
30 September 2012 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
MXMaosheng Xiong
Maosheng Xiong

6 June 2013 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JYJing Yang
Jing Yang
MXMaosheng Xiong
Maosheng Xiong
CDCunsheng Ding
Cunsheng Ding
JLJinquan Luo
Jinquan Luo
Cyclic codes have been widely used in digital communication systems and consumer electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many years. It is in general hard to determine the weight distribution of linear codes. In this paper, a class of cyclic codes with any number of zeros is described and their weight distributions are determined.

24 August 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SLShuxing Li
Shuxing Li
CDCunsheng Ding
Cunsheng Ding
MXMaosheng Xiong
Maosheng Xiong
GGGennian Ge
Gennian Ge
Cyclic codes are widely employed in communication systems, storage devices, and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over GF(q) with length n = (q m -1)/(q -1). Little is known about this class of BCH codes when q > 2. The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of some ternary BCH codes with length n = (3 m - 1)/2 are determined in this paper. A class of ternary BCH codes meeting the Griesmer bound is identified. An application of some of the BCH codes in secret sharing is also investigated.

26 February 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SLShuxing Li
Shuxing Li
MXMaosheng Xiong
Maosheng Xiong
GGGennian Ge
Gennian Ge
Constacyclic codes which generalize the classical cyclic codes have played important roles in recent constructions of many new quantum maximum distance separable (MDS) codes. However, the mathematical mechanism may not have been fully understood. In this paper, we use pseudo-cyclic codes, which is a further generalization of constacyclic codes, to construct the quantum MDS codes. We can not only provide a unified explanation of many previous constructions, but also produce some new quantum MDS codes.

18 June 2020 in Designs, Codes and Cryptography
Verified
Journal Article
Open access
PDF file
Sihem MesnagerSihem Mesnager
Sihem Mesnager
CTChunming Tang
Chunming Tang
MXMaosheng Xiong
Maosheng Xiong
At Eurocrypt’18, Cid, Huang, Peyrin, Sasaki, and Song introduced a new tool called Boomerang Connectivity Table (BCT) for measuring the resistance of a block cipher against the boomerang attack which is an important cryptanalysis technique introduced by Wagner in 1999 against block ciphers. Next, Boura and Canteaut introduced an important parameter related to the BCT for cryptographic S-boxes called boomerang uniformity. The purpose of this paper is to present a brief state-of-the-art on the notion of boomerang uniformity of vectorial Boolean functions (or S-boxes) and provide new results. More specifically, we present a slightly different but more convenient formulation of the boomerang uniformity and prove some new identities. Moreover, we focus on quadratic permutations in even dimension and obtain general criteria by which they have optimal BCT. As a consequence of the new criteria, two previously known results can be derived, and many new quadratic permutations with optimal BCT (optimal means that the maximal value in the Boomerang Connectivity Table equals the lowest known differential uniformity) can be found. In particular, we show that the boomerang uniformity of the binomial differentially 4-uniform permutations presented by Bracken, Tan, and Tan equals 4. Furthermore, we show a link between the boomerang uniformity and the nonlinearity for some special quadratic permutations. Finally, we present a characterization of quadratic permutations with boomerang uniformity 4. With this characterization, we show that the boomerang uniformity of a quadratic permutation with boomerang uniformity 4 is preserved by the extended affine (EA) equivalence.

16 December 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CTChunming Tang
Chunming Tang
CDCunsheng Ding
Cunsheng Ding
MXMaosheng Xiong
Maosheng Xiong
Boolean functions, coding theory and t-designs have close connections and interesting interplay. A standard approach to constructing t-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the automorphism groups are two ways for proving that a code has sufficient regularity for supporting t-designs. However, some linear codes hold t-designs, although they do not satisfy the conditions in the Assmus-Mattson Theorem and do not admit a t-transitive or t-homogeneous group as a subgroup of their automorphisms. The major objective of this paper is to develop a theory for explaining such codes and obtaining such new codes and hence new t-designs. To this end, a general theory for punctured and shortened codes of linear codes supporting t-designs is established, a generalized Assmus-Mattson theorem is developed, and a link between 2-designs and differentially δ-uniform functions and 2-designs is built. With these general results, binary codes with new parameters and explicit weight distributions are obtained, new 2-designs and Steiner system S(2,4,2n) are produced in this paper.