Classification of binary/ternary one-error-correcting codes
From MaRDI portal
Publication:1587610
DOI10.1016/S0012-365X(00)00017-0zbMath0976.94035OpenAlexW2055928319MaRDI QIDQ1587610
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
upper boundsbacktrack searchminimum distanceerror-correcting codesmixed codemaximum cardinalityisomorph rejectionbinary and ternary coordinatescode equivalences
Related Items (4)
Linear ternary codes of strongly regular signed graphs ⋮ Semidefinite bounds for mixed binary/ternary codes ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ An updated table of binary/ternary mixed covering codes
This page was built for publication: Classification of binary/ternary one-error-correcting codes