  
  
  [1XReferences[101X
  
  [[20XAll84[120X]  [16XAlltop,  W.  O.[116X,  [17XA  method for extending binary linear codes[117X, [18XIEEE
  Trans. Inform. Theory[118X, [19X30[119X (1984), 871–872.
  
  [[20XBMd)[120X]  [16XBazzi,  L. and Mitter, S. K.[116X, [17XSome constructions of codes from group
  actions[117X, [18Xpreprint[118X (March 2003 (submitted)).
  
  [[20XBro06[120X]  [16XBrouwer,  A.  E.[116X,  [17XBounds  on  the minimum distance of linear codes[117X
  (1997-2006),
  \href{http://www.win.tue.nl/~aeb/voorlincod.html}{http://www.win.tue.nl/~aeb/voorlincod.html}.
  
  [[20XBro98[120X]  [16XBrouwer,  A.  E.[116X ([1m[31mPless, V. S. and Huffman, W. C.[15X, Eds.), [17XBounds on
  the  Size  of  Linear  Codes[117X, in Handbook of Coding Theory, {Elsevier, North
  Holland} (1998), 295–461.
  
  [[20XChe69[120X]   [16XChen,   C.   L.[116X,   [17XSome   Results   on   Algebraically  Structured
  Error-Correcting  Codes[117X,  Ph.{D}  Dissertation,  {University of Hawaii}, USA
  (1969).
  
  [[20XGDT91[120X]  [16XGabidulin,  E.,  Davydov,  A.  and  Tombak,  L.[116X,  [17XLinear codes with
  covering  radius 2 and other new covering codes[117X, [18XIEEE Trans. Inform. Theory[118X,
  [19X37[119X, 1 (1991), 219–224.
  
  [[20XGal62[120X]  [16XGallager,  R.[116X,  [17XLow-Density  Parity-Check Codes[117X, [18XIRE Trans. Inform.
  Theory[118X, [19XIT-8[119X (1962), 21–28.
  
  [[20XGao03[120X]   [16XGao,   S.[116X,  [17XA  new  algorithm  for  decoding  Reed-Solomon  codes[117X,
  [18XCommunications,  Information  and Network Security (V. Bhargava, H. V. Poor,
  V. Tarokh and S. Yoon, Eds.)[118X, Kluwer Academic Publishers (2003), 55–68.
  
  [[20XGS85[120X]  [16XGraham,  R.  and  Sloane,  N.[116X, [17XOn the covering radius of codes[117X, [18XIEEE
  Trans. Inform. Theory[118X, [19X31[119X, 1 (1985), 385–401.
  
  [[20XHan99[120X]  [16XHansen,  J.  P.[116X,  [17XToric surfaces and error-correcting codes[117X, [18XCoding
  theory,   cryptography,   and   related   areas   (ed.,   Bachmann  et  al)[118X,
  Springer-Verlag (1999).
  
  [[20XHHKK07[120X] [16XHarada, M., Holzmann, W., Kharaghani, H. and Khorvash, M.[116X, [17XExtremal
  Ternary  Self-Dual Codes Constructed from Negacirculant Matrices[117X, [18XGraphs and
  Combinatorics[118X, [19X23[119X, 4 (2007), 401–417.
  
  [[20XHel72[120X]  [16XHelgert,  H.  J.[116X,  [17XSrivastava codes[117X, [18XIEEE Trans. Inform. Theory[118X, [19X18[119X
  (1972), 292–297.
  
  [[20XHP03[120X] [16XHuffman, W. C. and Pless, V.[116X, [17XFundamentals of error-correcting codes[117X,
  Cambridge Univ. Press (2003).
  
  [[20XJoy04[120X]  [16XJoyner,  D.[116X,  [17XToric codes over finite fields[117X, [18XApplicable Algebra in
  Engineering, Communication and Computing[118X, [19X15[119X (2004), 63–79.
  
  [[20XJH04[120X]  [16XJustesen,  J.  and  Hoholdt, T.[116X, [17XA course in error-correcting codes[117X,
  European Mathematical Society (2004).
  
  [[20XLeo82[120X]  [16XLeon,  J.  S.[116X,  [17XComputing  automorphism  groups of error-correcting
  codes[117X, [18XIEEE Trans. Inform. Theory[118X, [19X28[119X (1982), 496–511.
  
  [[20XLeo88[120X] [16XLeon, J. S.[116X, [17XA probabilistic algorithm for computing minimum weights
  of  large  error-correcting  codes[117X,  [18XIEEE  Trans. Inform. Theory[118X, [19X34[119X (1988),
  1354–1359.
  
  [[20XLeo91[120X]  [16XLeon,  J.  S.[116X, [17XPermutation group algorithms based on partitions, I:
  theory and algorithms[117X, [18XJ. Symbolic Comput.[118X, [19X12[119X (1991), 533–583.
  
  [[20XMS83[120X]   [16XMacWilliams,   F.   J.   and  Sloane,  N.  J.  A.[116X,  [17XThe  theory  of
  error-correcting codes[117X, Amsterdam: North-Holland (1983).
  
  [[20XSRC72[120X]  [16XSloane,  N.,  Reddy, S. and Chen, C.[116X, [17XNew binary codes[117X, [18XIEEE Trans.
  Inform. Theory[118X, [19X18[119X (1972), 503–510.
  
  [[20XSti93[120X]    [16XStichtenoth,   H.[116X,   [17XAlgebraic   function   fields   and   codes[117X,
  Springer-Verlag (1993).
  
  [[20XTSSFJ04[120X]  [16XTanner,  R.,  Sridhara,  D., Sridharan, A., Fuja, T. and Costello
  Jr.,  D.[116X,  [17XLDPC  Block  and Convolutional Codes Based on Circulant Matrices[117X,
  [18XIEEE Trans. Inform. Theory[118X, [19X50[119X, 12 (2004), 2966–2984.
  
  [[20XGG03[120X]  [16Xvon  zur  Gathen,  J.  and  Gerhard,  J.[116X,  [17XModern  computer algebra[117X,
  Cambridge Univ. Press (2003).
  
  [[20XZim96[120X]  [16XZimmermann,  K.  H.[116X,  [17XIntegral  Hecke Modules, Integral Generalized
  Reed-Muller Codes, and Linear Codes[117X, Technische Universität Hamburg-Harburg,
  3–96, Hamburg, Germany (1996).
  
  
  
  [32X
