On binary/ternary error-correcting codes with minimum distance 4

DOI10.1007/3-540-46796-3_45MaRDI QIDQ4502654zbMATH OpenFDO

Authors Patric R. J. Östergård

Publication date 13 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46796-3_45

zbMATH Keywords

backtrackingerror-correcting codesisomorphism rejectionmixed alphabets

Mathematics Subject Classification ID

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

Recommendations

• Classification of binary/ternary one-error-correcting codes
• Bounds on mixed binary/ternary codes
• Mixed binary/ternary covering codes
• Error-correcting codes over an alphabet of four elements
• An updated table of binary/ternary mixed covering codes

Cited in

(10)

• Classification of binary/ternary one-error-correcting codes
• Semidefinite bounds for mixed binary/ternary codes
• New lower bounds on \(q\)-ary error-correcting codes
• Two new four-error-correcting binary codes
• scientific article; zbMATH DE number 3880595 (Why is no real title available?)
• Binary Construction of Quantum Codes of Minimum Distance Three and Four
• Bounds on mixed binary/ternary codes
• On the minimum distance of the duals of 4-error correcting extended BCH codes
• Mixed binary/ternary covering codes
• Linear ternary codes of strongly regular signed graphs

Describes a project that uses

Uses Software

• nauty

This page was built for publication: On binary/ternary error-correcting codes with minimum distance 4

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