Optimal binary linear codes from posets of the disjoint union of two chains.
Saved in:
| Title: | Optimal binary linear codes from posets of the disjoint union of two chains. |
|---|---|
| Authors: | Wu, Yansheng, Hyun, Jong Yoon, Yue, Qin |
| Source: | Advances in Mathematics of Communications; Nov2022, Vol. 16 Issue 4, p1-8, 8p |
| Subject Terms: | LINEAR codes, BINARY codes, PARTIALLY ordered sets |
| Abstract: | Recently, some infinite families of optimal binary linear codes are constructed from simplicial complexes. Afterwards, the construction method was extended to using arbitrary posets. In this paper, based on a generic construction of linear codes, we obtain four classes of optimal binary linear codes by using the posets of two chains. Two of them induce Griesmer codes which are not equivalent to the linear codes constructed by Belov. Those codes are exploited to construct secret sharing schemes in cryptography as well. [ABSTRACT FROM AUTHOR] |
| Copyright of Advances in Mathematics of Communications is the property of American Institute of Mathematical Sciences 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.) | |
| Database: | Complementary Index |
Nájsť tento článok vo Web of Science Be the first to leave a comment!