LowerBoundMinimumDistance( C )
In this form, LowerBoundMinimumDistance
returns a lower bound for the
minimum distance of code C.
gap> C := BCHCode( 45, 7 ); a cyclic [45,23,7..9]6..16 BCH code, delta=7, b=1 over GF(2) gap> LowerBoundMinimumDistance( C ); 7 # designed distance is lower bound for minimum distance
LowerBoundMinimumDistance( n, k, F )
In this form, LowerBoundMinimumDistance
returns a lower bound for the
minimum distance of the best known linear code of length n, dimension
k over field F. It uses the mechanism explained in section
BoundsMinimumDistance.
gap> LowerBoundMinimumDistance( 45, 23, GF(2) ); 10
GAP 3.4.4