Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria
Date Issued
2009
Author(s)
Abstract
Given a linear code [n, k, d] with parity check matrix H, we provide
inequality that supports existence of a code with parameters [n + l + 1, k + l, d].
We show that this inequality is stronger than the Gilbert-Varshamov (GV) bound
even if the existence of the code [n, k, d] is guaranteed by the GV bound itself.
