Minimum Distance of Codes and Their Branching Program Complexity

Nandakishore Santhi, Alexander Vardy. Minimum Distance of Codes and Their Branching Program Complexity. In Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006. pages 1490-1494, IEEE, 2006. [doi]

@inproceedings{SanthiV06,
  title = {Minimum Distance of Codes and Their Branching Program Complexity},
  author = {Nandakishore Santhi and Alexander Vardy},
  year = {2006},
  doi = {10.1109/ISIT.2006.262116},
  url = {https://doi.org/10.1109/ISIT.2006.262116},
  researchr = {https://researchr.org/publication/SanthiV06},
  cites = {0},
  citedby = {0},
  pages = {1490-1494},
  booktitle = {Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006},
  publisher = {IEEE},
  isbn = {1-4244-0504-1},
}