Back to Search
Start Over
Construction of strongly optimal binary linear code with sets representation.
- Source :
-
AIP Conference Proceedings . 2020, Vol. 2326 Issue 1, p1-4. 4p. - Publication Year :
- 2020
-
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]
- Subjects :
- *BINARY codes
*LINEAR codes
*CONSTRUCTION
*MAXIMA & minima
Subjects
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 2326
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 148594771
- Full Text :
- https://doi.org/10.1063/5.0039285