A new binary code of length 16 and minimum distance 3

DOI10.1016/J.IPL.2015.07.001MaRDI QIDQ495687zbMATH OpenOpenAlexFDO

Authors Moshe Milshtein

Publication date 15 September 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.07.001

zbMATH Keywords

Hamming distancelower boundcombinatorial problemsbinary codeblock code

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited in

(3)

• Constructing error-correcting binary codes using transitive permutation groups
• A [45,13] code with minimal distance 16
• A simple proof of the improved Johnson bound for binary codes

This page was built for publication: A new binary code of length 16 and minimum distance 3

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