  
  
  [1m[4m[31mReferences[0m
  
  [33m[BMT)]  [0m[1m[31mBazzi,  L.  and Mitter, S. K. [0m, [34mSome constructions of codes from
  group actions[0m (preprint March 2003 (submitted to IEEE IT))
  
  [33m[B06]  [0m[1m[31mBrouwer,  A. E. [0m, [34mBounds on the minimum distance of linear codes[0m,
  On          the          internet          at          the          URL:
  http$://$www.win.tue.nl$/\tilde$aeb$/$voorlincod.html (1997-2006)
  
  [33m[GDT91] [0m[1m[31mGabidulin, E. and Davydov, A. and Tombak, L. [0m, [34mLinear codes with
  covering  radius  2  and  other  new covering codes[0m, IEEE Trans. Inform.
  Theory, [34m37[0m (1) (1991), 219--224
  
  [33m[G03]  [0m[1m[31mGao,  S.  [0m,  [34mA  new  algorithm  for  decoding Reed-Solomon codes[0m,
  Communications,  Information  and  Network  Security (V. Bhargava, H. V.
  Poor,  V.  Tarokh and S. Yoon, Eds.), Kluwer Academic Publishers (2003),
  pp. 55-68
  
  [33m[GJ03]  [0m[1m[31mvon  zur  Gathen,  J. and J. Gerhard, [0m, [34mModern computer algebra[0m,
  Cambridge Univ. Press (2003)
  
  [33m[GS85] [0m[1m[31mGraham, R. and Sloane, N. [0m, [34mOn the covering radius of codes[0m, IEEE
  Trans. Inform. Theory, [34m31[0m (1) (1985), 385--401
  
  [33m[H99]  [0m[1m[31mHansen, J. P. [0m, [34mToric surfaces and error-correcting codes[0m, Coding
  theory,   cryptography,   and   related  areas  (ed.,  Bachmann  et  al)
  Springer-Verlag (1999)
  
  [33m[H72]  [0m[1m[31mHelgert, H. J. [0m, [34mSrivastava codes[0m, IEEE Trans. Inform. Theory, [34m18[0m
  (1972), 292--297
  
  [33m[HP03]  [0m[1m[31mHuffman,  W. C. and Pless, V. [0m, [34mFundamentals of error-correcting
  codes[0m, Cambridge Univ. Press (2003)
  
  [33m[J04] [0m[1m[31mJoyner, D. [0m, [34mToric codes over finite fields[0m, Applicable Algebra in
  Engineering, Communication and Computing, [34m15[0m (2004), 63--79
  
  [33m[JH04]  [0m[1m[31mJustesen,  J.  and  Hoholdt,  T.  [0m, [34mA course in error-correcting
  codes[0m, European Mathematical Society (2004)
  
  [33m[L82]  [0m[1m[31mLeon,  J.  S. [0m, [34mComputing automorphism groups of error-correcting
  codes[0m, IEEE Trans. Inform. Theory, [34m28[0m (1982), 496--511
  
  [33m[L88]  [0m[1m[31mLeon,  J.  S.  [0m,  [34mA probabilistic algorithm for computing minimum
  weights  of large error-correcting codes[0m, IEEE Trans. Inform. Theory, [34m34[0m
  (1988), 1354--1359
  
  [33m[L91] [0m[1m[31mLeon, J. S. [0m, [34mPermutation group algorithms based on partitions, I:
  theory and algorithms[0m, J. Symbolic Comput., [34m12[0m (1991), 533--583
  
  [33m[MS83]  [0m[1m[31mMacWilliams,  F.  J.  and  Sloane,  N.  J.  A.  [0m,  [34mThe theory of
  error-correcting codes[0m, Amsterdam: North-Holland (1983)
  
  [33m[S93]   [0m[1m[31mStichtenoth,   H.   [0m,   [34mAlgebraic  function  fields  and  codes[0m,
  Springer-Verlag (1993)
  
  
  
  -------------------------------------------------------
