Note on the size of binary Armstrong codes

DOI10.1007/S10623-012-9711-5MaRDI QIDQ2439741zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

databasescoding theoryArmstrong codes

Mathematics Subject Classification ID

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

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

Cites work

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

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)