How to solve the N-bit encoder problem with one hidden unit and polynomially increasing weights and thresholds

Xun Liang, Shaowei Xia, Jihong Du. How to solve the N-bit encoder problem with one hidden unit and polynomially increasing weights and thresholds. Neurocomputing, 7(1):85-87, 1995. [doi]

@article{LiangXD95,
  title = {How to solve the N-bit encoder problem with one hidden unit and polynomially increasing weights and thresholds},
  author = {Xun Liang and Shaowei Xia and Jihong Du},
  year = {1995},
  doi = {10.1016/0925-2312(94)00017-M},
  url = {http://dx.doi.org/10.1016/0925-2312(94)00017-M},
  researchr = {https://researchr.org/publication/LiangXD95},
  cites = {0},
  citedby = {0},
  journal = {Neurocomputing},
  volume = {7},
  number = {1},
  pages = {85-87},
}