Abstract
Summary
This note generalises some results of Bambah, Joshi and Luthar (1961) on the lower bound for the number of sequences in a minimum distance binary code.
Get full access to this article
View all access options for this article.
You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026
Filter Results
Select search scope: search across all journals or within the current journal
Search this journal
Enter search terms…
/