Bibliographic Details
| Title: |
Construction of strongly optimal binary linear code with sets representation. |
| Authors: |
Utomo, Putranto Hadi, Guritman, Sugi, Mas'oed, Teduh Wulandari, Sumarno, Hadi, Indriati, Diari, Kusmayadi, Tri Atmojo, Sutrima, Sutrima, Saputro, Dewi Retno Sari |
| Source: |
AIP Conference Proceedings; 2020, Vol. 2326 Issue 1, p1-4, 4p |
| Subject Terms: |
BINARY codes, LINEAR codes, CONSTRUCTION, MAXIMA & minima |
| Abstract: |
A binary linear code of length n over Fq is a subspace of F q n . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d]- code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert-Varshamov bound, if a [n, k, d]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we created a theorem based on Gilbert-Varshamov bound for the sets representation. [ABSTRACT FROM AUTHOR] |
|
Copyright of AIP Conference Proceedings is the property of American Institute of Physics 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