  
  
  [1XReferences[101X
  
  [[20XAll84[120X]  [16XAlltop,  W.  O.[116X,  [17XA  method for extending binary linear codes[117X, [18XIEEE
  Trans. Inform. Theory[118X, [19X30[119X, 6 (1984), 871-872.
  
  [[20XBM06[120X]  [16XBazzi, L. and Mitter, S. K.[116X, [17XSome Randomized Code Constructions From
  Group Actions[117X, [18XIEEE Trans. Inform. Theory[118X, [19X52[119X, 7 (2006), 3210-3219.
  
  [[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, Amsterdam
  (1998), 295-461.
  
  [[20XBro06[120X]  [16XBrouwer,  A.  E.[116X,  [17XBounds  on  the minimum distance of linear codes[117X
  (1997-2006), https://www.codetables.de/.
  
  [[20XChe69[120X]   [16XChen,   C.   L.[116X,   [17XSome   Results   on   Algebraically  Structured
  Error-Correcting   Codes[117X,   Doctoral  Dissertation,  University  of  Hawaii,
  Honolulu, USA (1969).
  
  [[20XGal62[120X]  [16XGallager,  R.[116X,  [17XLow-Density  Parity-Check  Codes[117X,  [18XIRE  Trans. Inf.
  Theor.[118X, [19XIT-8[119X (1962), 21-28.
  
  [[20XGao03[120X]  [16XGao, S.[116X ([1m[31mBhargava, V., Poor, H. V., Tarokh, V. and Yoon, S.[15X, Eds.),
  [17XA   New  Algorithm  for  Decoding  Reed-Solomon  Codes[117X,  in  Communications,
  Information and Network Security, Springer, Boston, MA (2003), 55-68.
  
  [[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.
  
  [[20XGS85[120X]  [16XGraham,  R.  and  Sloane,  N.[116X, [17XOn the Covering Radius of Codes[117X, [18XIEEE
  Trans. Inform. Theory[118X, [19X31[119X, 3 (1985), 385-401.
  
  [[20XHan00[120X]  [16XHansen,  J.  P.[116X  ([1m[31mBuchmann,  J.,  Høholdt,  T., Stichtenoth, H. and
  Tapia-Recillas,  H.[15X,  Eds.),  [17XToric  Surfaces and Error-correcting Codes[117X, in
  Coding  Theory,  Cryptography and Related Areas, Springer, Berlin Heidelberg
  (2000), 132-142.
  
  [[20XHel72[120X]  [16XHelgert, H. J.[116X, [17XSrivastava Codes[117X, [18XIEEE Trans. Inform. Theory[118X, [19X18[119X, 2
  (1972), 292-297.
  
  [[20XHHKK07[120X] [16XHarada, M., Holzmann, W., Kharaghani, H. and Khorvash, M.[116X, [17XExtremal
  Ternary  Self-Dual  Codes  Constructed  from  Negacirculant Matrices[117X, [18XGraphs
  Combin.[118X, [19X23[119X, 4 (2007), 401-417.
  
  [[20XHP03[120X] [16XHuffman, W. C. and Pless, V.[116X, [17XFundamentals of error-correcting codes[117X,
  Cambridge University Press (2003).
  
  [[20XJH04[120X]  [16XJustesen,  J.  and  Høholdt, T.[116X, [17XA course in Error-Correcting Codes[117X,
  European Mathematical Society, EMS Textbooks in Mathematics (2004).
  
  [[20XJoy04[120X]  [16XJoyner,  D.[116X,  [17XToric  codes over finite fields[117X, [18XAppl. Algebra Engrg.
  Comm. Comput.[118X, [19X15[119X, 1 (2004), 63-79.
  
  [[20XLeo82[120X]  [16XLeon,  J.  S.[116X,  [17XComputing  automorphism  groups of error-correcting
  codes[117X, [18XIEEE Trans. Inform. Theory[118X, [19X28[119X, 3 (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, 5 (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, 4-5 (1991), 533-583.
  
  [[20XMS83[120X]   [16XMacWilliams,   F.   J.   and  Sloane,  N.  J.  A.[116X,  [17XThe  theory  of
  error-correcting  codes[117X,  North-Holland, North-Holland Mathematical Library,
  [19X16[119X, Amsterdam (1983).
  
  [[20XSRC72[120X]  [16XSloane,  N.,  Reddy, S. and Chen, C.[116X, [17XNew binary codes[117X, [18XIEEE Trans.
  Inform. Theory[118X, [19X18[119X, 4 (1972), 503-510.
  
  [[20XSti93[120X]  [16XStichtenoth,  H.[116X,  [17XAlgebraic  Function  Fields and Codes[117X, Springer,
  Graduate Texts in Mathematics, [19X254[119X (1993).
  
  [[20XTSS+04[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.
  
  [[20XvzGG03[120X]  [16Xvon  zur  Gathen,  J.  and  Gerhard,  J.[116X, [17XModern computer algebra[117X,
  Cambridge University 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
