Bambah, R. P. ; Joshi, D. D. ; Luthar, Indar S. (1961) Some lower bounds on the number of code points in a minimum distance binary code. I Information and Control, 4 (4). pp. 313-319. ISSN 0019-9958
Full text not available from this repository.
Official URL: http://linkinghub.elsevier.com/retrieve/pii/S00199...
Related URL: http://dx.doi.org/10.1016/S0019-9958(61)80046-6
Abstract
M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming distance between any two sequences of the set is at least d.| M(n, d) | denotes the number of sequences in the set M(n, d). In this paper we obtain some lower bounds for | M(n, d) | for special values of n and d. The results are better than the known results due to Gilbert.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 29974 |
| Deposited On: | 23 Dec 2010 03:53 |
| Last Modified: | 13 May 2011 04:15 |
Repository Staff Only: item control page
