An Algorithm to Compute a Nearest Point in the Lattice A::n:::::*:::

I. Vaughan, L. Clarkson. An Algorithm to Compute a Nearest Point in the Lattice A::n:::::*:::. In Marc P. C. Fossorier, Hideki Imai, Shu Lin, Alain Poli, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings. Volume 1719 of Lecture Notes in Computer Science, pages 104-120, Springer, 1999.

@inproceedings{VaughanC99,
  title = {An Algorithm to Compute a Nearest Point in the Lattice A::n:::::*:::},
  author = {I. Vaughan and L. Clarkson},
  year = {1999},
  researchr = {https://researchr.org/publication/VaughanC99},
  cites = {0},
  citedby = {0},
  pages = {104-120},
  booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings},
  editor = {Marc P. C. Fossorier and Hideki Imai and Shu Lin and Alain Poli},
  volume = {1719},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66723-7},
}