Name
Abstract | ||
|---|---|---|
It is well-known that cyclic codes have efficient encoding and decoding algorithms. In recent years, antiprimitive BCH codes have attracted a lot of attention. The objective of this paper is to study BCH codes of this type over finite fields and analyse their parameters. Some lower bounds on the minimum distance of antiprimitive BCH codes are given. The BCH codes presented in this paper have good ... |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TIT.2021.3131810 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Codes,Liquid crystal displays,Linear codes,Generators,Codecs,Mathematics,Support vector machines | Journal | 68 |
Issue | ISSN | Citations |
3 | 0018-9448 | 1 |
PageRank | References | Authors |
0.37 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongwei Zhu | 1 | 4 | 1.95 |
| Minjia Shi | 2 | 28 | 20.11 |
| Xiaoqiang Wang | 3 | 1 | 0.37 |
| Tor Helleseth | 4 | 1 | 0.37 |