<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html> <head> <title>UTas ePrints - An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings</title> <script type="text/javascript" src="http://eprints.utas.edu.au/javascript/auto.js"><!-- padder --></script> <style type="text/css" media="screen">@import url(http://eprints.utas.edu.au/style/auto.css);</style> <style type="text/css" media="print">@import url(http://eprints.utas.edu.au/style/print.css);</style> <link rel="icon" href="/images/eprints/favicon.ico" type="image/x-icon" /> <link rel="shortcut icon" href="/images/eprints/favicon.ico" type="image/x-icon" /> <link rel="Top" href="http://eprints.utas.edu.au/" /> <link rel="Search" href="http://eprints.utas.edu.au/cgi/search" /> <meta content="Cazaran, Jilyana" name="eprints.creators_name" /> <meta content="Kelarev, Andrei" name="eprints.creators_name" /> <meta content="Quinn, Stephen" name="eprints.creators_name" /> <meta content="Vertigan, Dirk" name="eprints.creators_name" /> <meta content="article" name="eprints.type" /> <meta content="2007-04-02" name="eprints.datestamp" /> <meta content="2008-01-08 15:30:00" name="eprints.lastmod" /> <meta content="show" name="eprints.metadata_visibility" /> <meta content="An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings" name="eprints.title" /> <meta content="pub" name="eprints.ispublished" /> <meta content="280110" name="eprints.subjects" /> <meta content="280103" name="eprints.subjects" /> <meta content="280506" name="eprints.subjects" /> <meta content="restricted" name="eprints.full_text_status" /> <meta content="Journal HomePage: http://www.springerlink.com/link.asp?id=103374. Our joint work on this project started during a visit ofthe first and fourth authors to the University of Tasmania on sabbatical from Louisiana State University in 2003. The second and third authors have been supported by Australian Research Council, Discovery grant DP0449469. " name="eprints.note" /> <meta content="An algorithm is given for computing the weights of extensions of BCH codes embedded in semigroup rings as ideals. The algorithm relies on a more general technical result of independent interest. " name="eprints.abstract" /> <meta content="2006" name="eprints.date" /> <meta content="published" name="eprints.date_type" /> <meta content="Semigroup Forum" name="eprints.publication" /> <meta content="73" name="eprints.volume" /> <meta content="317-329" name="eprints.pagerange" /> <meta content="10.1007/s00233-006-0647-9" name="eprints.id_number" /> <meta content="UNSPECIFIED" name="eprints.thesis_type" /> <meta content="TRUE" name="eprints.refereed" /> <meta content="0037-1912" name="eprints.issn" /> <meta content="http://dx.doi.org/10.1007/s00233-006-0647-9" name="eprints.official_url" /> <meta content="[1] Alfaro, R. and A. V. Kelarev, Recent results on ring constructions for error-correcting codes, "Structures and Their Representations", XV Coloquio Latinoamericano de Algebra (Cocoyoc, Morelos, Mexico, July 20-ÃÂÃÂ26, 2003), Contemporary Math. 376 (2005), 1-12. [2] Alfaro, R. and A. V. Kelarev, On cyclic codes in incidence rings, Studia Sci. Math. Hungarica 43(1) (2006), 69-77. [3] Araujo, I. M., A. V. Kelarev and A. Solomon, An algorithm for commutative semigroup algebras which are principal ideal rings with identity, Comm. Algebra. 32(4) (2004), 1237-ÃÂÃÂ1254. [4] Atiyah, M. and I. McDonald, "ÃÂÃÂIntroduction to Commutative Algebra"ÃÂÃÂ, Addison-Wesley, 1969. [5] Berman, S. D., On the theory of group codes, Cibernetics 3 (1967), 25-ÃÂÃÂ31. [6] Campbell, C. M., E. F. Robertson, N. Ru.skuc and R. M. Thomas, Reidemeister-Schreier type rewriting for semigroups, Semigroup Forum 51 (1995), 47-ÃÂÃÂ62. [7] Cazaran, J. and A. V. Kelarev, Generators and weights of polynomial codes, Arch. Math. (Basel) 69 (1997), 479-486. [8] Charpin, P., The Reed-Solomon code as ideals of a modular algebra, C. R. Acad. Sci. Paris Ser. I Math. 294 (1982), 597-600. [9] Charpin, P., A generalization of Berman's construction of p-ary Reed-Muller codes, Comm. Algebra 16 (1988), 2231-2246. [10] Charpin, P., Self-dual codes which are principal ideals of the group algebra F2[{F2m,+}], J. Statist. Plann. Inference 56(1) (1996), 79-ÃÂÃÂ92. [11] Chen, X., I. S. Reed, T. Helleseth, and T. K. Truong, Algebraic decoding of cyclic codes: a polynomial ideal point of view, "Finite Fields: Theory, Applications, and Algorithms"ÃÂÃÂ, Contemp. Math. 168, 15-22. [12] Cormen, T. H., C. E. Leiserson, R. L. Rivest and C. Stein, "ÃÂÃÂIntroduction to Algorithms"ÃÂÃÂ, MIT Press, Cambridge, 2001. [13] Drensky, V. and P. Lakatos, Monomial ideals, group algebras and error correcting codes, ÃÂÃÂ"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes", Lecture Notes in Comput. Sci. 357 (1989), 181-ÃÂÃÂ188. [14] Grillet, P.-A., "ÃÂÃÂSemigroups. An Introduction to the Structure Theory"ÃÂÃÂ, Dekker, New York, 1995. [15] Grillet, P.-A., Computing finite commutative semigroups, Semigroup Forum 53 (1996)(2), 140-154. [16] Hall, T.E., The radical of the algebra of any finite semigroup over any field, J. Austral. Math. Soc. Ser. A 11 (1970), 350-352. [17] Hall, T. E., Biprefix codes, inverse semigroups and syntactic monoids of injective automata, Theoretical Computer Science 32(1-2) (1984), 201-213. [18] Howie, J. M., "ÃÂÃÂFundamentals ofSemigroup Theory", Clarendon Press, Oxford, 1995. [19] Kelarev, A. V., Radicals of semigroup rings of commutative semigroups, Semigroup Forum 48 (1994), 1-17. [20] Kelarev, A. V., "Ring Constructions and Applications"ÃÂÃÂ, World Scientific, London, 2002. [21] Kelarev, A. V., "Graph Algebras and Automata", Marcel Dekker, New York, 2003. [22] Kelarev, A. V., Minimum distances and information rates for matrix extensions of BCH codes, The 3rd Workshop on the Internet, Telecommunications and Signal Processing, WITSP 2004, (Adelaide, 20-22 December 2004), 1-6. [23] Kelarev, A. V., A Polynomial Algorithm for Codes Based on Directed Graphs, In Proc. Twelfth Computing: The Australasian Theory Symposium (CATS2006), Hobart, Australia. CRPIT, 51 (2006), J. Gudmundsson and B. Jay, Eds., ACS, 87-92. [24] Kelarev, A. V. and O. V. Sokratova, Information rates and weights of codes in structural matrix rings, Lecture Notes in Computer Science 2227 (2001), 151-ÃÂÃÂ158. [25] Kelarev, A. V. and P. Sole, Error-correcting codes as ideals in group rings, "Abelian Rings, Groups and Modules", AGRAM 2000, (September 2000, Perth, Australia), Contemporary Mathematics 273 (2001), 11-18. [26] Landrock, P. and O. Manz, Classical codes as ideals in group algebras, Des. Codes and Crypt. 2 (1992), 273-285. [27] Lidl, R. and H. Niederreiter, "Introductions to Finite Fields and Their Applications"ÃÂÃÂ, Cambridge University Press, Cambridge, 1994. [28] Lidl, R. and H. Niederreiter, "ÃÂÃÂFinite Fields"ÃÂÃÂ, Cambridge University Press, Cambridge, 1997. [29] Lidl, R. and G. Pilz, "Applied Abstract Algebra"ÃÂÃÂ, Springer-Verlag, Berlin, 1998. [30] Lidl, R. and J. Wiesenbauer, "Ring Theory and Applications", Wiesbaden, 1980, in German. [31] Okninski, J., "ÃÂÃÂSemigroup Algebras"ÃÂÃÂ, Marcel Dekker, New York, 1991. [32] Pless, V. S., W. C. Huffman and R. A. Brualdi, "ÃÂÃÂHandbook of Coding Theory"ÃÂÃÂ, Elsevier, New York, 1998. [33] Ponizovski.i, J. S., Semigroup rings, Semigroup Forum 36 (1987), 1-ÃÂÃÂ46. [34] Rajan, B. S. and M. U. Siddiqi, Transform domain characterization of abelian codes, IEEE Trans. Inform. Theory 38 (1992), 1817-ÃÂÃÂ1821. [35] Renteria, C. and H. Tapia Recillas, Reed-Muller codes: an ideal theory approach, Comm. Algebra 25 (1997), 401-413. [36] Rosales, J. C. and P. A. Garcia-Sanchez, "ÃÂÃÂFinitely Generated Commutative Monoids", Nova Science Publ., New York, 1999. [37] Ru.skuc, N., Presentations for subgroups of monoids, J. Algebra 220(1) (1999), 365-ÃÂÃÂ380. [38] Sims, C. C., "Computation with Finitely Presented Groups", University Press, Cambridge, 1994. [39] Sabin, R. E., On minimum distance bounds for abelian codes, Appl. Algebra Engrg. Comm. Comput. 3 (1992), 183-ÃÂÃÂ197. [40] Shevrin, L. N. and A. Ja. Ovsyannikov, "ÃÂÃÂSemigroups and their Subsemigroup Lattices", Kluwer, Dordrecht, 1996. [41] Stallings, W., "Wireless Communications and Networking", Prentice Hall, 2002. [42] Teply, M. L., E. G. Turman and A. Quesada, On semisimple semigroup rings, Proc. Amer. Math. Soc. 79 (1980), 157-ÃÂÃÂ163. [43] Vertigan, Dirk, Latroids and their representation by codes over modules, Trans. Amer. Math. Soc. 356(10) (2004), 3841-3868. " name="eprints.referencetext" /> <meta content="Cazaran, Jilyana and Kelarev, Andrei and Quinn, Stephen and Vertigan, Dirk (2006) An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings. Semigroup Forum, 73 . pp. 317-329. ISSN 0037-1912" name="eprints.citation" /> <meta content="http://eprints.utas.edu.au/893/1/kelarev2006.pdf" name="eprints.document_url" /> <link rel="schema.DC" href="http://purl.org/DC/elements/1.0/" /> <meta content="An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings" name="DC.title" /> <meta content="Cazaran, Jilyana" name="DC.creator" /> <meta content="Kelarev, Andrei" name="DC.creator" /> <meta content="Quinn, Stephen" name="DC.creator" /> <meta content="Vertigan, Dirk" name="DC.creator" /> <meta content="280110 Systems Theory" name="DC.subject" /> <meta content="280103 Information Storage, Retrieval and Management" name="DC.subject" /> <meta content="280506 Coding and Information Theory" name="DC.subject" /> <meta content="An algorithm is given for computing the weights of extensions of BCH codes embedded in semigroup rings as ideals. The algorithm relies on a more general technical result of independent interest. " name="DC.description" /> <meta content="2006" name="DC.date" /> <meta content="Article" name="DC.type" /> <meta content="PeerReviewed" name="DC.type" /> <meta content="application/pdf" name="DC.format" /> <meta content="http://eprints.utas.edu.au/893/1/kelarev2006.pdf" name="DC.identifier" /> <meta content="http://dx.doi.org/10.1007/s00233-006-0647-9" name="DC.relation" /> <meta content="Cazaran, Jilyana and Kelarev, Andrei and Quinn, Stephen and Vertigan, Dirk (2006) An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings. Semigroup Forum, 73 . pp. 317-329. ISSN 0037-1912" name="DC.identifier" /> <meta content="http://eprints.utas.edu.au/893/" name="DC.relation" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/BibTeX/epprod-eprint-893.bib" title="BibTeX" type="text/plain" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/ContextObject/epprod-eprint-893.xml" title="OpenURL ContextObject" type="text/xml" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/ContextObject::Dissertation/epprod-eprint-893.xml" title="OpenURL Dissertation" type="text/xml" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/ContextObject::Journal/epprod-eprint-893.xml" title="OpenURL Journal" type="text/xml" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/DC/epprod-eprint-893.txt" title="Dublin Core" type="text/plain" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/DIDL/epprod-eprint-893.xml" title="DIDL" type="text/xml" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/EndNote/epprod-eprint-893.enw" title="EndNote" type="text/plain" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/HTML/epprod-eprint-893.html" title="HTML Citation" type="text/html; charset=utf-8" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/METS/epprod-eprint-893.xml" title="METS" type="text/xml" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/MODS/epprod-eprint-893.xml" title="MODS" type="text/xml" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/RIS/epprod-eprint-893.ris" title="Reference Manager" type="text/plain" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/Refer/epprod-eprint-893.refer" title="Refer" type="text/plain" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/Simple/epprod-eprint-893text" title="Simple Metadata" type="text/plain" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/Text/epprod-eprint-893.txt" title="ASCII Citation" type="text/plain; charset=utf-8" /> <link rel="alternate" href="http://eprints.utas.edu.au/cgi/export/893/XML/epprod-eprint-893.xml" title="EP3 XML" type="text/xml" /> </head> <body bgcolor="#ffffff" text="#000000" onLoad="loadRoutine(); MM_preloadImages('images/eprints/ePrints_banner_r5_c5_f2.gif','images/eprints/ePrints_banner_r5_c7_f2.gif','images/eprints/ePrints_banner_r5_c8_f2.gif','images/eprints/ePrints_banner_r5_c9_f2.gif','images/eprints/ePrints_banner_r5_c10_f2.gif','images/eprints/ePrints_banner_r5_c11_f2.gif','images/eprints/ePrints_banner_r6_c4_f2.gif')"> <div class="ep_noprint"><noscript><style type="text/css">@import url(http://eprints.utas.edu.au/style/nojs.css);</style></noscript></div> <table width="795" border="0" cellspacing="0" cellpadding="0"> <tr> <td><script language="JavaScript1.2">mmLoadMenus();</script> <table border="0" cellpadding="0" cellspacing="0" width="795"> <!-- fwtable fwsrc="eprints_banner_final2.png" fwbase="ePrints_banner.gif" fwstyle="Dreamweaver" fwdocid = "1249563342" fwnested="0" --> <tr> <td><img src="/images/eprints/spacer.gif" width="32" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="104" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="44" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="105" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="41" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="16" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="68" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="68" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="68" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="82" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="69" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="98" height="1" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="1" border="0" alt="" /></td> </tr> <tr> <td colspan="12"><img name="ePrints_banner_r1_c1" src="/images/eprints/ePrints_banner_r1_c1.gif" width="795" height="10" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="10" border="0" alt="" /></td> </tr> <tr> <td rowspan="6"><img name="ePrints_banner_r2_c1" src="/images/eprints/ePrints_banner_r2_c1.gif" width="32" height="118" border="0" alt="" /></td> <td rowspan="5"><a href="http://www.utas.edu.au/"><img name="ePrints_banner_r2_c2" src="/images/eprints/ePrints_banner_r2_c2.gif" width="104" height="103" border="0" alt="" /></a></td> <td colspan="10"><img name="ePrints_banner_r2_c3" src="/images/eprints/ePrints_banner_r2_c3.gif" width="659" height="41" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="41" border="0" alt="" /></td> </tr> <tr> <td colspan="3"><a href="http://eprints.utas.edu.au/"><img name="ePrints_banner_r3_c3" src="/images/eprints/ePrints_banner_r3_c3.gif" width="190" height="31" border="0" alt="" /></a></td> <td rowspan="2" colspan="7"><img name="ePrints_banner_r3_c6" src="/images/eprints/ePrints_banner_r3_c6.gif" width="469" height="37" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="31" border="0" alt="" /></td> </tr> <tr> <td colspan="3"><img name="ePrints_banner_r4_c3" src="/images/eprints/ePrints_banner_r4_c3.gif" width="190" height="6" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="6" border="0" alt="" /></td> </tr> <tr> <td colspan="2"><img name="ePrints_banner_r5_c3" src="/images/eprints/ePrints_banner_r5_c3.gif" width="149" height="1" border="0" alt="" /></td> <td rowspan="2" colspan="2"><a href="/information.html" onMouseOut="MM_swapImgRestore();MM_startTimeout()" onMouseOver="MM_showMenu(window.mm_menu_0821132634_0,0,25,null,'ePrints_banner_r5_c5');MM_swapImage('ePrints_banner_r5_c5','','/images/eprints/ePrints_banner_r5_c5_f2.gif',1);"><img name="ePrints_banner_r5_c5" src="/images/eprints/ePrints_banner_r5_c5.gif" width="57" height="25" border="0" alt="About" /></a></td> <td rowspan="2"><a href="/view/" onMouseOut="MM_swapImgRestore();MM_startTimeout()" onMouseOver="MM_showMenu(window.mm_menu_0821133021_1,0,25,null,'ePrints_banner_r5_c7');MM_swapImage('ePrints_banner_r5_c7','','/images/eprints/ePrints_banner_r5_c7_f2.gif',1);"><img name="ePrints_banner_r5_c7" src="/images/eprints/ePrints_banner_r5_c7.gif" width="68" height="25" border="0" alt="Browse" /></a></td> <td rowspan="2"><a href="/perl/search/simple" onMouseOut="MM_swapImgRestore();MM_startTimeout()" onMouseOver="MM_showMenu(window.mm_menu_0821133201_2,0,25,null,'ePrints_banner_r5_c8');MM_swapImage('ePrints_banner_r5_c8','','/images/eprints/ePrints_banner_r5_c8_f2.gif',1);"><img name="ePrints_banner_r5_c8" src="/images/eprints/ePrints_banner_r5_c8.gif" width="68" height="25" border="0" alt="Search" /></a></td> <td rowspan="2"><a href="/perl/register" onMouseOut="MM_swapImgRestore();MM_startTimeout();" onMouseOver="MM_showMenu(window.mm_menu_1018171924_3,0,25,null,'ePrints_banner_r5_c9');MM_swapImage('ePrints_banner_r5_c9','','/images/eprints/ePrints_banner_r5_c9_f2.gif',1);"><img name="ePrints_banner_r5_c9" src="/images/eprints/ePrints_banner_r5_c9.gif" width="68" height="25" border="0" alt="register" /></a></td> <td rowspan="2"><a href="/perl/users/home" onMouseOut="MM_swapImgRestore();MM_startTimeout()" onMouseOver="MM_showMenu(window.mm_menu_0821133422_4,0,25,null,'ePrints_banner_r5_c10');MM_swapImage('ePrints_banner_r5_c10','','/images/eprints/ePrints_banner_r5_c10_f2.gif',1);"><img name="ePrints_banner_r5_c10" src="/images/eprints/ePrints_banner_r5_c10.gif" width="82" height="25" border="0" alt="user area" /></a></td> <td rowspan="2"><a href="/help/" onMouseOut="MM_swapImgRestore();MM_startTimeout()" onMouseOver="MM_showMenu(window.mm_menu_0821133514_5,0,25,null,'ePrints_banner_r5_c11');MM_swapImage('ePrints_banner_r5_c11','','/images/eprints/ePrints_banner_r5_c11_f2.gif',1);"><img name="ePrints_banner_r5_c11" src="/images/eprints/ePrints_banner_r5_c11.gif" width="69" height="25" border="0" alt="Help" /></a></td> <td rowspan="3" colspan="4"><img name="ePrints_banner_r5_c12" src="/images/eprints/ePrints_banner_r5_c12.gif" width="98" height="40" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="1" border="0" alt="" /></td> </tr> <tr> <td rowspan="2"><img name="ePrints_banner_r6_c3" src="/images/eprints/ePrints_banner_r6_c3.gif" width="44" height="39" border="0" alt="ePrints home" /></td> <td><a href="/" onMouseOut="MM_swapImgRestore()" onMouseOver="MM_swapImage('ePrints_banner_r6_c4','','/images/eprints/ePrints_banner_r6_c4_f2.gif',1);"><img name="ePrints_banner_r6_c4" src="/images/eprints/ePrints_banner_r6_c4.gif" width="105" height="24" border="0" alt="ePrints home" /></a></td> <td><img src="/images/eprints/spacer.gif" width="1" height="24" border="0" alt="" /></td> </tr> <tr> <td><img name="ePrints_banner_r7_c2" src="/images/eprints/ePrints_banner_r7_c2.gif" width="104" height="15" border="0" alt="" /></td> <td colspan="8"><img name="ePrints_banner_r7_c4" src="/images/eprints/ePrints_banner_r7_c4.gif" width="517" height="15" border="0" alt="" /></td> <td><img src="/images/eprints/spacer.gif" width="1" height="15" border="0" alt="" /></td> </tr> </table></td> </tr> <tr><td><table width="100%" style="font-size: 90%; border: solid 1px #ccc; padding: 3px"><tr> <td align="left"><a href="http://eprints.utas.edu.au/cgi/users/home">Login</a> | <a href="http://eprints.utas.edu.au/cgi/register">Create Account</a></td> <td align="right" style="white-space: nowrap"> <form method="get" accept-charset="utf-8" action="http://eprints.utas.edu.au/cgi/search" style="display:inline"> <input class="ep_tm_searchbarbox" size="20" type="text" name="q" /> <input class="ep_tm_searchbarbutton" value="Search" type="submit" name="_action_search" /> <input type="hidden" name="_order" value="bytitle" /> <input type="hidden" name="basic_srchtype" value="ALL" /> <input type="hidden" name="_satisfyall" value="ALL" /> </form> </td> </tr></table></td></tr> <tr> <td class="toplinks"><!-- InstanceBeginEditable name="content" --> <div align="center"> <table width="720" class="ep_tm_main"><tr><td align="left"> <h1 class="ep_tm_pagetitle">An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings</h1> <p style="margin-bottom: 1em" class="not_ep_block"><span class="person_name">Cazaran, Jilyana</span> and <span class="person_name">Kelarev, Andrei</span> and <span class="person_name">Quinn, Stephen</span> and <span class="person_name">Vertigan, Dirk</span> (2006) <xhtml:em>An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings.</xhtml:em> Semigroup Forum, 73 . pp. 317-329. ISSN 0037-1912</p><p style="margin-bottom: 1em" class="not_ep_block"></p><table style="margin-bottom: 1em" class="not_ep_block"><tr><td valign="top" style="text-align:center"><a href="http://eprints.utas.edu.au/893/1/kelarev2006.pdf"><img alt="[img]" src="http://eprints.utas.edu.au/style/images/fileicons/application_pdf.png" class="ep_doc_icon" border="0" /></a></td><td valign="top"><a href="http://eprints.utas.edu.au/893/1/kelarev2006.pdf"><span class="ep_document_citation">PDF</span></a> - Full text restricted - Requires a PDF viewer<br />341Kb</td></tr></table><p style="margin-bottom: 1em" class="not_ep_block">Official URL: <a href="http://dx.doi.org/10.1007/s00233-006-0647-9">http://dx.doi.org/10.1007/s00233-006-0647-9</a></p><div class="not_ep_block"><h2>Abstract</h2><p style="padding-bottom: 16px; text-align: left; margin: 1em auto 0em auto">An algorithm is given for computing the weights of extensions of BCH codes embedded in semigroup rings as ideals. The algorithm relies on a more general technical result of independent interest. </p></div><table style="margin-bottom: 1em" cellpadding="3" class="not_ep_block" border="0"><tr><th valign="top" class="ep_row">Item Type:</th><td valign="top" class="ep_row">Article</td></tr><tr><th valign="top" class="ep_row">Additional Information:</th><td valign="top" class="ep_row">Journal HomePage: http://www.springerlink.com/link.asp?id=103374. Our joint work on this project started during a visit ofthe first and fourth authors to the University of Tasmania on sabbatical from Louisiana State University in 2003. The second and third authors have been supported by Australian Research Council, Discovery grant DP0449469. </td></tr><tr><th valign="top" class="ep_row">Subjects:</th><td valign="top" class="ep_row"><a href="http://eprints.utas.edu.au/view/subjects/280110.html">280000 Information, Computing and Communication Sciences > 280100 Information Systems > 280110 Systems Theory</a><br /><a href="http://eprints.utas.edu.au/view/subjects/280103.html">280000 Information, Computing and Communication Sciences > 280100 Information Systems > 280103 Information Storage, Retrieval and Management</a><br /><a href="http://eprints.utas.edu.au/view/subjects/280506.html">280000 Information, Computing and Communication Sciences > 280500 Data Format > 280506 Coding and Information Theory</a></td></tr><tr><th valign="top" class="ep_row">ID Code:</th><td valign="top" class="ep_row">893</td></tr><tr><th valign="top" class="ep_row">Deposited By:</th><td valign="top" class="ep_row"><span class="ep_name_citation"><span class="person_name">Dr Andrei Kelarev</span></span></td></tr><tr><th valign="top" class="ep_row">Deposited On:</th><td valign="top" class="ep_row">02 Apr 2007</td></tr><tr><th valign="top" class="ep_row">Last Modified:</th><td valign="top" class="ep_row">09 Jan 2008 02:30</td></tr><tr><th valign="top" class="ep_row">ePrint Statistics:</th><td valign="top" class="ep_row"><a target="ePrintStats" href="/es/index.php?action=show_detail_eprint;id=893;">View statistics for this ePrint</a></td></tr></table><p align="right">Repository Staff Only: <a href="http://eprints.utas.edu.au/cgi/users/home?screen=EPrint::View&eprintid=893">item control page</a></p> </td></tr></table> </div> <!-- InstanceEndEditable --></td> </tr> <tr> <td><!-- #BeginLibraryItem "/Library/footer_eprints.lbi" --> <table width="795" border="0" align="left" cellpadding="0" class="footer"> <tr valign="top"> <td colspan="2"><div align="center"><a href="http://www.utas.edu.au">UTAS home</a> | <a href="http://www.utas.edu.au/library/">Library home</a> | <a href="/">ePrints home</a> | <a href="/contact.html">contact</a> | <a href="/information.html">about</a> | <a href="/view/">browse</a> | <a href="/perl/search/simple">search</a> | <a href="/perl/register">register</a> | <a href="/perl/users/home">user area</a> | <a href="/help/">help</a></div><br /></td> </tr> <tr><td colspan="2"><p><img src="/images/eprints/footerline.gif" width="100%" height="4" /></p></td></tr> <tr valign="top"> <td width="68%" class="footer">Authorised by the University Librarian<br /> © University of Tasmania ABN 30 764 374 782<br /> <a href="http://www.utas.edu.au/cricos/">CRICOS Provider Code 00586B</a> | <a href="http://www.utas.edu.au/copyright/copyright_disclaimers.html">Copyright & Disclaimers</a> | <a href="http://www.utas.edu.au/accessibility/index.html">Accessibility</a> | <a href="http://eprints.utas.edu.au/feedback/">Site Feedback</a> </td> <td width="32%"><div align="right"> <p align="right" class="NoPrint"><a href="http://www.utas.edu.au/"><img src="http://www.utas.edu.au/shared/logos/unioftasstrip.gif" alt="University of Tasmania Home Page" width="260" height="16" border="0" align="right" /></a></p> <p align="right" class="NoPrint"><a href="http://www.utas.edu.au/"><br /> </a></p> </div></td> </tr> <tr valign="top"> <td><p> </p></td> <td><div align="right"><span class="NoPrint"><a href="http://www.eprints.org/software/"><img src="/images/eprintslogo.gif" alt="ePrints logo" width="77" height="29" border="0" align="bottom" /></a></span></div></td> </tr> </table> <!-- #EndLibraryItem --> <div align="center"></div></td> </tr> </table> </body> </html>