Pairs of codes with prescribed Hamming distances and coincidences

DOI10.1007/S10623-006-0016-4MaRDI QIDQ851769zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4127151
• Inequalities for code pairs
• Code pairs with specified parity of the Hamming distances
• scientific article; zbMATH DE number 3985112
• A two-family extremal problem in Hamming space

Cites work

• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A new proof of several inequalities on codes and sets
• Constructing set systems with prescribed intersection sizes
• On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
• 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

Cited in

(4)

• scientific article; zbMATH DE number 4127151 (Why is no real title available?)
• Code pairs with specified parity of the Hamming distances
• Set systems with k-wise L-intersections and codes with restricted Hamming distances
• scientific article; zbMATH DE number 4164739 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851769)