Note on the size of binary Armstrong codes
- 16 June 2012
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 71 (1) , 1-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Coding Theory Motivated by Relational Databases2011
- Codes that attain minimum distance in every possible directionOpen Mathematics, 2008
- On the Existence of Armstrong Instances with Bounded Domains2008
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977