Classification of binary/ternary one-error-correcting codes

DOI10.1016/S0012-365X(00)00017-0zbMATH Open0976.94035OpenAlexW2055928319MaRDI QIDQ1587610FDOQ1587610

Authors: Patric R. J. Östergård 

Publication date: 3 December 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00017-0

Recommendations

• Publication:4502654
• One-error correcting [5, 2] ternary codes
• scientific article; zbMATH DE number 1933266
• scientific article; zbMATH DE number 2148772
• Classifying optimal ternary codes of length 5 and covering radius 1

zbMATH Keywords

minimum distanceupper boundserror-correcting codesmixed codemaximum cardinalitybacktrack searchisomorph rejectionbinary and ternary coordinatescode equivalences

Mathematics Subject Classification ID

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

Cited In (12)

• Classifying optimal ternary codes of length 5 and covering radius 1
• Semidefinite bounds for mixed binary/ternary codes
• New lower bounds on \(q\)-ary error-correcting codes
• On ternary error correcting line codes
• Linear ternary codes of strongly regular signed graphs
• Title not available (Why is that?)
• One-error correcting [5, 2] ternary codes
• An updated table of binary/ternary mixed covering codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Classification of binary/ternary one-error-correcting codes

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