Coding Theory

Computational Methods

  1. Tsvetan Asamov and Nuh Aydin, A search algorithm for linear codes: Progressive dimension growth, Des. Codes Cryptogr. 45 (2007), no. 2, 213–217.[MR]
  2. Cesar A. Garcia-Vazquez and Carlos A. Lopez-Andrade, D-Heaps as hash tables for vectors over a finite ring, 2009 WRI World Conference on Computer Science and Information Engineering, WRI World Congress on Computer Science and Information Engineering, vol. 3, IEEE, 2009, pp. 162–166.[doi]
  3. Markus Grassl, Searching for linear codes with large minimum distance, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 287–313.[MR/doi]
  4. Markus Grassl, Computing extensions of linear codes, IEEE International Symposium on Information Theory, 2007. ISIT 2007 (2007), 476-480.[doi]
  5. Greg White and Markus Grassl, A new minimum weight algorithm for additive codes, Proceedings 2006 IEEE International Symposium on Information Theory (ISIT 2006), Seattle, USA, July 2006, IEEE, 2006, pp. 1119-1123.
  6. Gregory White, Enumeration-based Algorithms in Coding Theory, PhD Thesis, University of Sydney, 2007.