Abstract :
Theoretical bounds on the error-correcting capabilities of binary codes can be found for very long codes in terms of k/n and t/n. It is pointed out that these bounds are only valid for very long codes, and that the relationship between k/n and t/n is not a sufficient criterion for the practical value of short codes.
