In this work we try to introduce the concept of Maximal codes that are built over rings, more precisely we will give Maximal codes for special rings, Namely that the notion of maximal codes has been used by Chritophe ...In this work we try to introduce the concept of Maximal codes that are built over rings, more precisely we will give Maximal codes for special rings, Namely that the notion of maximal codes has been used by Chritophe Chapote, these maximal codes are constructed over finite fields, and these codes are used for coding and decoding.展开更多
In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length ...In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.展开更多
In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
文摘In this work we try to introduce the concept of Maximal codes that are built over rings, more precisely we will give Maximal codes for special rings, Namely that the notion of maximal codes has been used by Chritophe Chapote, these maximal codes are constructed over finite fields, and these codes are used for coding and decoding.
文摘In this paper, the maximal length of maximal distance separable (MDS) codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.
基金Supported by the National Natural Science Foundation of China(11861071).
文摘In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
