.png){kind=icon}
.png){kind=icon}
Return
Employing Non-Binary Simplex Codes Over Fp(Fp
.png){kind=icon}
PRE
AI
DOI：10.5269/bspm.77446.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article examines simplex codes categorized as types alpha and 3 over F-p (F-p + vF(p) ), along with exploring the p-array Gray representations of simplex codes of types alpha and 3 over the same field. Additionally, the article investigates the covering radius of simplex codes of types alpha and 3 over F-p (F-p + vF(p)). Lastly, the article delves into the construction of secret sharing schemes utilizing simplex codes over the finite field F-p .
Keywords:
Simplex codes
finite non chain rings
additive codes
covering radius
hamming and lee weights
Journal
B
IF:
0.4
Papers:
604
Citations:
0