On optimal binary codes with unbalanced coordinates
type: Item
instance of: scholarly article
title: On optimal binary codes with unbalanced coordinates
zbMATH Open document ID: 1283.94147
author: Patric R. J. Östergård
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2013-09-30T00:00:00Z
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 6212924
zbMATH Keywords: balanced code
zbMATH Keywords: bounds on codes
zbMATH Keywords: classification
zbMATH Keywords: code equivalence
zbMATH Keywords: error-correcting code
zbMATH Keywords: optimal code
describes a project that uses: Cliquer
MaRDI profile type: Publication
full work available at URL: s00200-013-0189-9
OpenAlex ID: W2013428639
cites work: A table of upper bounds for binary codes
cites work: On balanced codes
cites work: Q4342497
cites work: Further results on the covering radius of codes
cites work: Q3546840
cites work: Semidefinite Code Bounds Based on Quadruple Distances
cites work: On the failing cases of the Johnson bound for error-correcting codes
cites work: Classification algorithms for codes and designs
cites work: Efficient balanced codes
cites work: Q4146667
cites work: Covering arrays on graphs
cites work: Improved upper bounds on sizes of codes
cites work: New upper bounds on codes via association schemes and linear programming
cites work: Two new four-error-correcting binary codes
cites work: Disproof of a conjecture on the existence of balanced optimal covering codes
cites work: On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
cites work: A NEW FAMILY OF NONLINEAR CODES OBTAINED FROM CONFERENCE MATRICES
cites work: New family of single-error correcting codes
DOI: 10.1007/S00200-013-0189-9
description: scientific article; zbMATH DE number 6212924