6 views

1 Answers

In the mathematics of coding theory, the Griesmer bound, named after James Hugo Griesmer, is a bound on the length of linear binary codes of dimension k and minimum distance d.There is also a very similar version for non-binary codes.

6 views

Related Questions

What is Zyablov bound?
1 Answers 4 Views
What is Johnson bound?
1 Answers 4 Views
What is Elias Bassalygo bound?
1 Answers 7 Views
What is Minkowski's bound?
1 Answers 6 Views