Abstract
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binary linear code with word length n and dimension k, are shown.
Original language | English |
---|---|
Pages (from-to) | 662-677 |
Journal | IEEE Transactions on Information Theory |
Volume | 39 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1993 |