The hardness of solving subset sum with preprocessing

DOI10.1109/18.53763MaRDI QIDQ5895284zbMATH OpenOpenAlexFDO

Authors G. J. M. van Wee, Antoine Lobstein

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.53763

zbMATH Keywords

amalgamated direct sum constructioncovering radiuslower boundsnormal codeperfect codesubnormal codeternary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)

Cited in

(5)

• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
• All binary codes with covering radius one are subnormal
• On lengthening of covering codes
• On the normality of multiple covering codes
• An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm

This page was built for publication: The hardness of solving subset sum with preprocessing

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