Good linear codes from polynomial evaluations
In the present paper, we generalize the ideas of code constructions from our previous papers . 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, so...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2013
|
| 在線閱讀: | https://hdl.handle.net/10356/102717 http://hdl.handle.net/10220/16472 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| id |
sg-ntu-dr.10356-102717 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-1027172020-03-07T12:34:54Z Good linear codes from polynomial evaluations Ding, Yang Jin, Lingfei Xing, Chaoping School of Physical and Mathematical Sciences In the present paper, we generalize the ideas of code constructions from our previous papers . 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. 2013-10-14T05:57:58Z 2019-12-06T20:59:31Z 2013-10-14T05:57:58Z 2019-12-06T20:59:31Z 2012 2012 Journal Article Ding, Y., Jin, L., & Xing, C. (2012). Good Linear Codes from Polynomial Evaluations. IEEE Transactions on Communications, 60(2), 357-363. https://hdl.handle.net/10356/102717 http://hdl.handle.net/10220/16472 10.1109/TCOMM.2012.010512.100656 en IEEE transactions on communications |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| country |
Singapore |
| collection |
DR-NTU |
| language |
English |
| description |
In the present paper, we generalize the ideas of code constructions from our previous papers . 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. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Ding, Yang Jin, Lingfei Xing, Chaoping |
| format |
Article |
| author |
Ding, Yang Jin, Lingfei Xing, Chaoping |
| spellingShingle |
Ding, Yang Jin, Lingfei Xing, Chaoping Good linear codes from polynomial evaluations |
| author_sort |
Ding, Yang |
| title |
Good linear codes from polynomial evaluations |
| title_short |
Good linear codes from polynomial evaluations |
| title_full |
Good linear codes from polynomial evaluations |
| title_fullStr |
Good linear codes from polynomial evaluations |
| title_full_unstemmed |
Good linear codes from polynomial evaluations |
| title_sort |
good linear codes from polynomial evaluations |
| publishDate |
2013 |
| url |
https://hdl.handle.net/10356/102717 http://hdl.handle.net/10220/16472 |
| _version_ |
1681036834635776000 |