Pairs of codes with prescribed Hamming distances and coincidences
type: Item
instance of: scholarly article
title: Pairs of codes with prescribed Hamming distances and coincidences
zbMATH Open document ID: 1210.94117
author: Vince Grolmusz
published in: Designs, Codes and Cryptography
publication date: 2006-11-22T00:00:00Z
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 5075358
zbMATH Keywords: Multi-linear polynomials
zbMATH Keywords: Codes
zbMATH Keywords: Hamming-distance
zbMATH Keywords: Code-generation
MaRDI profile type: Publication
full work available at URL: s10623-006-0016-4
OpenAlex ID: W2046447920
cites work: A new proof of several inequalities on codes and sets
cites work: Representing Boolean functions as polynomials modulo composite numbers
cites work: Q5707657
cites work: Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
cites work: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
cites work: Constructing set systems with prescribed intersection sizes
cites work: On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
DOI: 10.1007/S10623-006-0016-4
description: scientific article; zbMATH DE number 5075358