Note on the size of binary Armstrong codes

DOI10.1007/S10623-012-9711-5zbMATH Open1323.94154OpenAlexW2163978560MaRDI QIDQ2439741FDOQ2439741

Authors: 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

Recommendations

• Recent developments in Armstrong codes
• On the Existence of Armstrong Instances with Bounded Domains
• Two new bounds on the size of binary codes with a minimum distance of three
• Some results on the existence of binary linear codes (Corresp.)
• Bounds for binary codes of length less than 25

zbMATH Keywords

databasescoding theoryArmstrong codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Bounds on codes (94B65)

Cites Work

• The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Title not available (Why is that?)
• Codes that attain minimum distance in every possible direction
• Coding theory motivated by relational databases
• Keys and Armstrong databases in trees with restructuring
• On the Existence of Armstrong Instances with Bounded Domains

Cited In (2)

• Recent developments in Armstrong codes
• On the Existence of Armstrong Instances with Bounded Domains

This page was built for publication: Note on the size of binary Armstrong codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439741)