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