Note on the size of binary Armstrong codes

A. Blokhuis, A.E. Brouwer, A. Sali

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
1 Downloads (Pure)


We show for binary Armstrong codes Arm(2, k, n) that asymptotically n/k = 1.224, while such a code is shown to exist whenever n/k = 1.12. We also construct an Arm(2, n - 2, n) and Arm(2, n - 3, n) for all admissible n. Keywords: Coding theory; Databases; Armstrong codes
Original languageEnglish
Pages (from-to)1-4
Number of pages4
JournalDesigns, Codes and Cryptography
Issue number1
Publication statusPublished - 2014


Dive into the research topics of 'Note on the size of binary Armstrong codes'. Together they form a unique fingerprint.

Cite this