An algorithm for computing bidirectional minimal polynomials for multisequences

Li-Ping Wang 0001. An algorithm for computing bidirectional minimal polynomials for multisequences. In IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings. pages 621-624, IEEE, 2009. [doi]

@inproceedings{000109-0,
  title = {An algorithm for computing bidirectional minimal polynomials for multisequences},
  author = {Li-Ping Wang 0001},
  year = {2009},
  doi = {10.1109/ISIT.2009.5205701},
  url = {http://doi.ieeecomputersociety.org/10.1109/ISIT.2009.5205701},
  researchr = {https://researchr.org/publication/000109-0},
  cites = {0},
  citedby = {0},
  pages = {621-624},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings},
  publisher = {IEEE},
  isbn = {978-1-4244-4312-3},
}