A new two-error-correcting binary code of length 16

DOI10.1007/S12095-019-00365-7MaRDI QIDQ2179504zbMATH OpenOpenAlexWikidataFDO

Authors Moshe Milshtein

Publication date 12 May 2020

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-019-00365-7

zbMATH Keywords

block codeerror-correcting codelower boundTabu search

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65)

Recommendations

• Bounds for binary codes of length less than 25
• A new upper bound for single error-correcting codes
• Two new four-error-correcting binary codes
• scientific article; zbMATH DE number 7274073
• Two new nonlinear binary codes

Cites work

• An optimum nonlinear code
• Tabu Search—Part I
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing

Cited in

(3)

• The sextuply shortened binary Golay code is optimal
• Two new four-error-correcting binary codes
• On the Maximal Cardinality of Binary Two-weight Codes

This page was built for publication: A new two-error-correcting binary code of length 16

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