{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:04:21Z","timestamp":1710349461604},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T00:00:00Z","timestamp":1378857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10623-013-9878-4","type":"journal-article","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T03:38:24Z","timestamp":1378870704000},"page":"511-531","source":"Crossref","is-referenced-by-count":9,"title":["Quasi-abelian codes"],"prefix":"10.1007","volume":"74","author":[{"given":"Somphong","family":"Jitman","sequence":"first","affiliation":[]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,11]]},"reference":[{"key":"9878_CR1","unstructured":"Bazzi L.M.J., Mitter S.K.: Some randomized code constructions from group actions. IEEE Trans. Inf. Theory 52, 3210\u20133219 (2006)."},{"key":"9878_CR2","unstructured":"Berman S.D.: Semi-simple cyclic and abelian codes. Kibernetika 3, 21\u201330 (1967)."},{"key":"9878_CR3","unstructured":"Berman S.D.: On the theory of group codes. Kibernetika 3, 31\u201339 (1967)."},{"key":"9878_CR4","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J.J., Playoust C.: The magma algebra system. I: the user language. J. Symb. Comput. 24, 235\u2013266 (1997).","DOI":"10.1006\/jsco.1996.0125"},{"key":"9878_CR5","unstructured":"Dey B.K., Rajan B.S.: Codes closed under arbitrary abelian group of permutations. SIAM J. Discret. Math. 18, 1\u201318 (2004)."},{"key":"9878_CR6","unstructured":"Ding C., Kohel D.R., Ling S.: Split group codes. IEEE Trans. Inf. Theory 46, 485\u2013495 (2000)."},{"key":"9878_CR7","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de . Accessed 25 April 2013."},{"key":"9878_CR8","unstructured":"Jitman S.: Generator matrices for new quasi-abelian codes. https:\/\/sites.google.com\/site\/quasiabeliancodes . Accessed 25 April 2013."},{"key":"9878_CR9","unstructured":"Lally K., Fitzpatrick P.: Algebraic structure of quasicyclic codes. Discret. Appl. Math. 111, 157\u2013175 (2001)."},{"key":"9878_CR10","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes. I: finite fields. IEEE Trans. Inf. Theory 47, 2751\u20132760 (2001)."},{"key":"9878_CR11","unstructured":"Ling S., Sol\u00e9 P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inf. Theory 49, 1052\u20131053 (2003)."},{"key":"9878_CR12","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes. III: generator theory. IEEE Trans. Inf. Theory 51, 2692\u20132700 (2005)."},{"key":"9878_CR13","unstructured":"Ling S., Xing C.: Polyadic codes revisited. IEEE Trans. Inf. Theory 50, 200\u2013207 (2004)."},{"key":"9878_CR14","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"key":"9878_CR15","unstructured":"Mart\u00ednez-P\u00e9rez C., Willems W.: Self-dual doubly even 2-quasi-cyclic transitive codes are asymptotically good. IEEE Trans. Inf. Theory 53, 4302\u20134308 (2007)."},{"key":"9878_CR16","unstructured":"Pei J., Zhang X.: 1-Generator quasi-cyclic codes. J. Syst. Sci. Complex 20, 554\u2013561 (2007)."},{"key":"9878_CR17","unstructured":"Pless V.: On the uniqueness of the Golay codes. J. Comb. Theory 5, 215\u2013228 (1968)."},{"key":"9878_CR18","unstructured":"Rains E.M., Sloane N.J.A.: Self-dual codes. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, pp. 177\u2013294. North-Holland, Amsterdam (1998)."},{"key":"9878_CR19","unstructured":"S\u00e9guin G.: A class of 1-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 50, 1745\u20131753 (2004)."},{"key":"9878_CR20","unstructured":"Wasan S.K.: Quasi abelian codes. Publ. Inst. Math. 35, 201\u2013206 (1977)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9878-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9878-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9878-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T18:15:57Z","timestamp":1563905757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9878-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,11]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9878"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9878-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,11]]}}}