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. Nuh Aydin, Tsvetan Asamov, and T. Aaron Gulliver, Some open problems on quasi-twisted and related code constructions and good quaternary codes, IEEE International Symposium on Information Theory, 2007. ISIT 2007 (2007), 856-860.[doi]