Can you explain what do Singleton bound, the sphere-packing bound and the Varshamor-Gilbert mean?
Determine what the Singleton bound, the sphere-packing bound and the Varshamor-Gilbert bound say about the maximum number of information bits that codewords with ten check bits can have if the codewords are protected from 3 or fewer errors.