Name
Abstract | ||
|---|---|---|
The Gleason---Pierce---Ward theorem gives constraints on the divisor and field size of a linear divisible code over a finite field whose dimension is half of the code length. This result is a departure point for the study of self-dual codes. In recent years, additive codes have been studied intensively because of their use in additive quantum codes. In this work, we generalize the Gleason---Pierce---Ward theorem on linear codes over GF(q), q = p m , to additive codes over GF(q). The first step of our proof is an application of a generalized upper bound on the dimension of a divisible code determined by its weight spectrum. The bound is proved by Ward for linear codes over GF(q), and is generalized by Liu to any code as long as the MacWilliams identities are satisfied. The trace map and an analogous homomorphism $${x\mapsto x-x^p}$$ on GF(q) are used to complete our proof. |
Year | DOI | Venue |
|---|---|---|
2009 | https://doi.org/10.1007/s10623-009-9286-y | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Additive codes,Gleason–Pierce–Ward theorem,Divisible codes,Ward’s bound,94B05 | Discrete mathematics,Hamming code,Combinatorics,Finite field,Group code,Polynomial code,Cyclic code,Homomorphism,Linear code,Divisor,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 3 | 0925-1022 |
Citations | PageRank | References |
1 | 0.41 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jon-Lark Kim | 1 | 312 | 34.62 |
| Xiaoyu Liu | 2 | 3 | 1.92 |