The uniformly packed binary \([27, 21, 3 ]\) and \([35, 29, 3 ]\) codes
type: Item
instance of: scholarly article
title: The uniformly packed binary \([27, 21, 3 ]\) and \([35, 29, 3 ]\) codes
zbMATH Open document ID: 0838.94014
DOI: 10.1016/0012-365X(95)00245-R
published in: Discrete Mathematics
publication date: 1996-03-25T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 20B25
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 858117
zbMATH Keywords: binary projective two-weight codes
zbMATH Keywords: automorphism groups
zbMATH Keywords: strongly regular graphs
zbMATH Keywords: linear binary uniformly packed codes
author: Vladimir D. Tonchev
MaRDI profile type: Publication
cites work: An updated table of minimum-distance bounds for binary linear codes
cites work: The Geometry of Two-Weight Codes
cites work: Weights of linear codes and strongly regular normed spaces
cites work: On the \([28,7,12]\) binary self-complementary codes and their residuals
cites work: Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
cites work: Q3946078
cites work: Q4146667
cites work: Q3888971
cites work: Q4040243
cites work: Quasi-symmetric designs, codes, quadrics, and hyperplane sections
full work available at URL: 0012-365x(95)00245-r
OpenAlex ID: W2012205881
description: scientific article; zbMATH DE number 858117