Note on the size of binary Armstrong codes
From MaRDI portal
Publication:2439741
DOI10.1007/s10623-012-9711-5zbMath1323.94154OpenAlexW2163978560MaRDI QIDQ2439741
Andries E. Brouwer, Attila Sali, Aart Blokhuis
Publication date: 17 March 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9711-5
Cites Work
- Unnamed Item
- Unnamed Item
- Codes that attain minimum distance in every possible direction
- Coding Theory Motivated by Relational Databases
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- On the Existence of Armstrong Instances with Bounded Domains
This page was built for publication: Note on the size of binary Armstrong codes