Wen Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Wen Ma has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Jinquan Luo
Central China Normal University
10 shared publications - Renjie Jin
School of Mathematics and Statistics & Hubei Key Laboratory of Mathematical Sciences Central China Normal University 430079 Wuhan China
2 shared publications Jinquan Luo
Central China Normal University
1 shared publication- Wolfgang Rump
Institute for Algebra and Number Theory, University of Stuttgart, Stuttgart, Germany
1 shared publication - Xia Zhang
School of Mathematical Sciences, South China Normal University, Guangzhou, China
1 shared publication Xiaolei Fang
1 shared publication
Latest Publications
- 14 March 2024
- Published by Springer Nature in Order
- Vol. 42 (1) , 1-23
Constructions of Codes with Weighted Poset Block Metrics
- 14 March 2024
- Published by Springer Nature in Order
- Vol. 42 (1) , 1-23
Constructions of Codes with Weighted Poset Block Metrics
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (2) , 267-282
Nonexistence of some four dimensional linear codes attaining the Griesmer bound
In coding theory, it is important to construct codes with optimal parameters. The codes meeting the Griesmer bound are called Griesmer codes. In this paper, we prove nonexistence of some Griesmer codes of dimension four over finite fields of cardinality eight and nine using projective geometry. Moreover, we improve 24 cases on code lengths for given minimal distance and dimension four. Two precise lower bounds of code lengths have also been determined.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (2) , 267-282
Nonexistence of some four dimensional linear codes attaining the Griesmer bound
In coding theory, it is important to construct codes with optimal parameters. The codes meeting the Griesmer bound are called Griesmer codes. In this paper, we prove nonexistence of some Griesmer codes of dimension four over finite fields of cardinality eight and nine using projective geometry. Moreover, we improve 24 cases on code lengths for given minimal distance and dimension four. Two precise lower bounds of code lengths have also been determined.
- 2 November 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 341-363
Codes with respect to weighted poset block metric
- 2 November 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (2) , 341-363
Codes with respect to weighted poset block metric
- 12 June 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (10) , 3263-3284
Block codes in pomset metric over ${\mathbb {Z}}_m$- 12 June 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (10) , 3263-3284
Block codes in pomset metric over ${\mathbb {Z}}_m$- Open Access
- 24 April 2023
- Published by Springer Nature in Research Square
Constructions of codes with weighted poset block metrics
Weighted poset block metric is a generalization of weighted poset metric introduced by Panek et al. ([14]) and the metric for linear error-block codes introduced by Feng et al. ([7]). This type of metrics includes many classical metrics such as Hamming metric, Lee metric, poset metric, pomset metric, poset block metric, pomset block metric and so on. In this work, we focus on constructing new codes under weighted poset block metric from given ones. Some basic properties such as minimum distance and covering radius are determined.
- 24 April 2023
- Published by Springer Nature in Research Square
Open AccessConstructions of codes with weighted poset block metrics
Weighted poset block metric is a generalization of weighted poset metric introduced by Panek et al. ([14]) and the metric for linear error-block codes introduced by Feng et al. ([7]). This type of metrics includes many classical metrics such as Hamming metric, Lee metric, poset metric, pomset metric, poset block metric, pomset block metric and so on. In this work, we focus on constructing new codes under weighted poset block metric from given ones. Some basic properties such as minimum distance and covering radius are determined.
- Open Access
Codes with Weighted Poset Block Metrics
Weighted poset block metric is a generalization of weighted poset metric introduced by Panek et al. ([\ref{panek}]) and the metric for linear error-block codes introduced by Feng et al. ([\ref{FENG}]). This type of metrics includes many classical metrics such as Hamming metric, Lee metric, poset metric, pomset metric, poset block metric, pomset block metric and so on. In this work, we focus on constructing new codes under weighted poset block metric from given ones. Some basic properties such as minimum distance and covering radius are determined.
Open AccessCodes with Weighted Poset Block Metrics
Weighted poset block metric is a generalization of weighted poset metric introduced by Panek et al. ([\ref{panek}]) and the metric for linear error-block codes introduced by Feng et al. ([\ref{FENG}]). This type of metrics includes many classical metrics such as Hamming metric, Lee metric, poset metric, pomset metric, poset block metric, pomset block metric and so on. In this work, we focus on constructing new codes under weighted poset block metric from given ones. Some basic properties such as minimum distance and covering radius are determined.
- Open AccessBlock Codes in Pomset Metric over $\mathbb{Z}_m$
In this paper, we introduce codes equipped with pomset block metric. A Singleton type bound for pomset block codes is obtained. Code achieving the Singleton bound, called a maximum distance separable code (for short, MDS ($\mathbb{P},π$)-code) is also investigated. We extend the concept of $I$-perfect codes and $r$-perfect codes to pomset block metric. The relation between $I$-perfect codes and MDS $(\mathbb{P},π)$-codes is also considered. When all blocks have the same dimension, we prove the duality theorem for codes and study the weight distribution of MDS pomset block codes when the pomset is a chain.
Open AccessBlock Codes in Pomset Metric over $\mathbb{Z}_m$In this paper, we introduce codes equipped with pomset block metric. A Singleton type bound for pomset block codes is obtained. Code achieving the Singleton bound, called a maximum distance separable code (for short, MDS ($\mathbb{P},π$)-code) is also investigated. We extend the concept of $I$-perfect codes and $r$-perfect codes to pomset block metric. The relation between $I$-perfect codes and MDS $(\mathbb{P},π)$-codes is also considered. When all blocks have the same dimension, we prove the duality theorem for codes and study the weight distribution of MDS pomset block codes when the pomset is a chain.
- Open Access
Groups of linear isometries on weighted poset block spaces
In this paper, we introduce a new family of metrics, weighted poset block metric, that combine the weighted coordinates poset metric introduced by Panek et al. [(\ref{panek})] and the metric for linear error-block codes introduced by Feng et al. [(\ref{FENG})]. This type of metrics include many classical metrics such as Hamming metric, Lee metric, poset metric, pomset metric, poset block metric, pomset block metric and so on. We give a complete description of the groups of linear isometries of these metric spaces in terms of a semi-direct product. Furthermore, we obtain a Singleton type bound for codes equipped with weighted poset block metric and define MDS codes. As a special case when the poset is a chain, we show that MDS codes are equivalent to perfect codes.
Open AccessGroups of linear isometries on weighted poset block spaces
In this paper, we introduce a new family of metrics, weighted poset block metric, that combine the weighted coordinates poset metric introduced by Panek et al. [(\ref{panek})] and the metric for linear error-block codes introduced by Feng et al. [(\ref{FENG})]. This type of metrics include many classical metrics such as Hamming metric, Lee metric, poset metric, pomset metric, poset block metric, pomset block metric and so on. We give a complete description of the groups of linear isometries of these metric spaces in terms of a semi-direct product. Furthermore, we obtain a Singleton type bound for codes equipped with weighted poset block metric and define MDS codes. As a special case when the poset is a chain, we show that MDS codes are equivalent to perfect codes.
- Open Access
MacWilliams Type Identities for Linear Block Codes on Certain Pomsets
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to certain pomsets. The relation between weight enumerators of two linear pomset block codes and their direct sum is also investigated.Open AccessMacWilliams Type Identities for Linear Block Codes on Certain Pomsets
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to certain pomsets. The relation between weight enumerators of two linear pomset block codes and their direct sum is also investigated. - 27 August 2021
- Published by Springer Nature in Cryptography and Communications
- Vol. 14 (1) , 145-159
New Galois Hulls of GRS Codes and Application to EAQECCs
- 27 August 2021
- Published by Springer Nature in Cryptography and Communications
- Vol. 14 (1) , 145-159
New Galois Hulls of GRS Codes and Application to EAQECCs