The hardness of solving subset sum with preprocessing
From MaRDI portal
Publication:5895284
DOI10.1109/18.53763zbMath0714.94017OpenAlexW2042339194MaRDI QIDQ5895284
G. J. M. van Wee, Antoine C. 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
covering radiuslower boundsternary codesperfect codeamalgamated direct sum constructionnormal codesubnormal code
Related Items (5)
Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ All binary codes with covering radius one are subnormal ⋮ An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm ⋮ On lengthening of covering codes ⋮ On the normality of multiple covering codes
This page was built for publication: The hardness of solving subset sum with preprocessing