Construction of strongly optimal binary linear code with sets representation.

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]