Advances in Mathematics of Communications
November 2021 , Volume 15 , Issue 4
Select all articles
A classical approach to constructing combinatorial designs is the group action of a
In this paper, we study several definitions of generalized rank weights for arbitrary finite extensions of fields. We prove that all these definitions coincide, generalizing known results for extensions of finite fields.
One of the best methods for constructing maximum distance separable (
This paper is about a first characterization of LCD skew constacyclic codes and some constructions of LCD skew cyclic and skew negacyclic codes over
Computational techniques for the construction of quasi-symmetric block designs are explored and applied to the case with
In this paper, we give a classification of a sequence family, over arbitrary characteristic, adding linear trace terms to the function
We convert Stern's information set decoding (ISD) algorithm to the ring
In this paper, we characterize all nonbinary sequences of length
Rotation symmetric bent functions are a special class of Boolean functions, and their construction is of theoretical and practical interest. In this paper, we propose a generic construction of rotation symmetric bent functions by modifying the support of a known class of quadratic rotation symmetric bent functions, which generalizes some earlier works. Moreover, many infinite classes of rotation symmetric bent functions with maximal algebraic degree can be easily obtained from our construction.
We study mixed alphabet cyclic and constacyclic codes over the two alphabets
Three classes of (balanced) Boolean functions with few Walsh transform values derived from bent functions, Gold functions and the product of linearized polynomials are obtained in this paper. Further, the value distributions of their Walsh transform are also determined by virtue of the property of bent functions, the Walsh transform property of Gold functions and the
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]