Pairs of codes with prescribed Hamming distances and coincidences

DOI10.1007/S10623-006-0016-4zbMATH Open1210.94117OpenAlexW2046447920MaRDI QIDQ851769FDOQ851769

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

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

zbMATH Keywords

CodesCode-generationHamming-distanceMulti-linear polynomials

Mathematics Subject Classification ID

Other types of codes (94B60)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Code pairs with specified parity of the Hamming distances
• Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances
• Title not available (Why is that?)

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)