Approximately counting the number of constrained arrays via the sum-product algorithm

Farzad Parvaresh, Pascal O. Vontobel. Approximately counting the number of constrained arrays via the sum-product algorithm. In Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012. pages 279-283, IEEE, 2012. [doi]

@inproceedings{ParvareshV12,
  title = {Approximately counting the number of constrained arrays via the sum-product algorithm},
  author = {Farzad Parvaresh and Pascal O. Vontobel},
  year = {2012},
  doi = {10.1109/ISIT.2012.6284033},
  url = {http://dx.doi.org/10.1109/ISIT.2012.6284033},
  researchr = {https://researchr.org/publication/ParvareshV12},
  cites = {0},
  citedby = {0},
  pages = {279-283},
  booktitle = {Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012},
  publisher = {IEEE},
  isbn = {978-1-4673-2580-6},
}