Rank weight hierarchy of some classes of polynomial codes
We study the rank weight hierarchy, thus in particular the minimum rank distance, of polynomial codes over the finite field $\FF_{q^m}$, $q$ a prime power, $m \geq 2$. We assume that polynomials involved are squarefree. We establish the rank weight hierarchy of $[n,n-1]$ constacyclic codes. We chara...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/163959 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|