Podrobná bibliografie
| Název: |
Optimal Binary Linear Codes From Maximal Arcs. |
| Autoři: |
Heng, Ziling, Ding, Cunsheng, Wang, Weiqiong |
| Zdroj: |
IEEE Transactions on Information Theory; Sep2020, Vol. 66 Issue 9, p5387-5394, 8p |
| Témata: |
LINEAR codes, BINARY codes, HAMMING codes |
| Abstrakt: |
The binary Hamming codes with parameters $[{2^{m}-1, 2^{m}-1-m, 3}]$ are perfect. Their extended codes have parameters $[{2^{m}, 2^{m}-1-m, 4}]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes with parameters $[{2^{m+s}+2^{s}-2^{m},2^{m+s}+2^{s}-2^{m}-2m-2,4}]$ , which have better information rates than the class of extended binary Hamming codes, and are also distance-optimal. The second objective is to construct a class of distance-optimal binary codes with parameters $[{2^{m}+2, 2^{m}-2m, 6}]$. Both classes of binary linear codes have new parameters. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Databáze: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science