Fast systematic encoding of quasi-cyclic codes using the Chinese remainder theorem

Pavel Panteleev. Fast systematic encoding of quasi-cyclic codes using the Chinese remainder theorem. In IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015. pages 1916-1920, IEEE, 2015. [doi]

@inproceedings{Panteleev15-0,
  title = {Fast systematic encoding of quasi-cyclic codes using the Chinese remainder theorem},
  author = {Pavel Panteleev},
  year = {2015},
  doi = {10.1109/ISIT.2015.7282789},
  url = {http://dx.doi.org/10.1109/ISIT.2015.7282789},
  researchr = {https://researchr.org/publication/Panteleev15-0},
  cites = {0},
  citedby = {0},
  pages = {1916-1920},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015},
  publisher = {IEEE},
  isbn = {978-1-4673-7704-1},
}