An upper bound on minimum distance for a k-ary code
- 31 July 1968
- journal article
- Published by Elsevier in Information and Control
- Vol. 13 (1) , 46-52
- https://doi.org/10.1016/s0019-9958(68)90779-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Binary codes with specified minimum distanceIEEE Transactions on Information Theory, 1960
- Some properties of nonbinary error-correcting codesIEEE Transactions on Information Theory, 1958
- Fourier integrals and metric geometryTransactions of the American Mathematical Society, 1941