On the additive complexity of the cyclotomic FFT algorithm

Peter Trifonov. On the additive complexity of the cyclotomic FFT algorithm. In 2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012. pages 537-541, IEEE, 2012. [doi]

@inproceedings{Trifonov12-0,
  title = {On the additive complexity of the cyclotomic FFT algorithm},
  author = {Peter Trifonov},
  year = {2012},
  doi = {10.1109/ITW.2012.6404732},
  url = {http://dx.doi.org/10.1109/ITW.2012.6404732},
  researchr = {https://researchr.org/publication/Trifonov12-0},
  cites = {0},
  citedby = {0},
  pages = {537-541},
  booktitle = {2012 IEEE Information Theory Workshop, Lausanne, Switzerland, September 3-7, 2012},
  publisher = {IEEE},
  isbn = {978-1-4673-0224-1},
}