Pairs of codes with prescribed Hamming distances and coincidences

DOI10.1007/s10623-006-0016-4zbMath1210.94117OpenAlexW2046447920MaRDI QIDQ851769

Vince Grolmusz

Publication date: 22 November 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-006-0016-4

zbMATH Keywords

CodesCode-generationHamming-distanceMulti-linear polynomials

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (1)

Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances

Cites Work

• Unnamed Item
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• Representing Boolean functions as polynomials modulo composite numbers
• Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
• On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
• A new proof of several inequalities on codes and sets
• Constructing set systems with prescribed intersection sizes

This page was built for publication: Pairs of codes with prescribed Hamming distances and coincidences