.png){kind=icon}
Return
Good Linear Codes from Polynomial Evaluations
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2012.010512.100656.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the present paper, we generalize the ideas of code constructions from our previous papers [8], [10], [11]. It turns out that the codes in the previous papers can be viewed as special cases of those in this paper. Moreover, our constructions produce some good codes in terms of their parameters. In particular, some best-known codes can be obtained through our methods. Furthermore, our constructions are explicit and the codes can be easily implemented as shown in the tables of Appendix. Besides, one new code, i.e., a 4-ary [64, 15, 31]-linear code, is found through our constructions.
Keywords:
Linear codes
optimal codes
echelon basis
conjugacy class
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
ShareSaveShareSaveZircon U-Pb, Molybdenite Re-Os and Quartz Vein Rb-Sr Geochronology of the Luobuzhen Au-Ag and Hongshan Cu Deposits, Tibet, China: Implications for the Oligocene-Miocene Porphyry–Epithermal Metallogenic System.png)
Minerals
OAAI
MineralsIF0
OAAIShareSave
no more
no more