{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:09:27Z","timestamp":1744898967444,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T00:00:00Z","timestamp":1454544000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s13638-016-0526-3","type":"journal-article","created":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T09:33:05Z","timestamp":1454578385000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An association between primitive and non-primitive BCH codes using monoid rings"],"prefix":"10.1186","volume":"2016","author":[{"given":"Asma Shaheen","family":"Ansari","sequence":"first","affiliation":[]},{"given":"Tariq","family":"Shah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,4]]},"reference":[{"key":"526_CR1","volume-title":"Cyclic error-correcting codes in two symbols","author":"E Prange","year":"1957","unstructured":"E Prange, Cyclic error-correcting codes in two symbols (Air force Cambridge research center, Cambridge, 1957). AFCRC-TN-57-103."},{"key":"526_CR2","volume-title":"The use of coset equivalence in the analysis and decoding of group codes","author":"E Prange","year":"1959","unstructured":"E Prange, The use of coset equivalence in the analysis and decoding of group codes (Air force Cambridge research center, Cambridge, 1959). AFCRC-TR-59-164."},{"key":"526_CR3","doi-asserted-by":"publisher","unstructured":"WW Peterson, Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans. IT-6, 459\u2013470 (1960).","DOI":"10.1109\/TIT.1960.1057586"},{"key":"526_CR4","first-page":"198","volume":"1","author":"T Kasami","year":"1960","unstructured":"T Kasami, Systematic codes using binary shift register sequences. J. Info. Processing Soc. Japan. 1:, 198\u2013200 (1960).","journal-title":"J. Info. Processing Soc. Japan"},{"issue":"6","key":"526_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s000130050149","volume":"69","author":"J Cazaran","year":"1997","unstructured":"J Cazaran, AV Kelarev, Generators and weights of polynomial codes. Archiv. Math. 69(6), 479\u2013486 (1997).","journal-title":"Archiv. Math"},{"issue":"1","key":"526_CR6","first-page":"77","volume":"68","author":"J Cazaran","year":"1999","unstructured":"J Cazaran, AV Kelarev, On finite principal ideal rings. Acta Math. Univ. Comenianae. 68(1), 77\u201384 (1999).","journal-title":"Acta Math. Univ. Comenianae"},{"key":"526_CR7","doi-asserted-by":"publisher","unstructured":"J Cazaran, AV Kelarev, SJ Quinn, D Vertigan D, An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings. Semigroup Forum. 73(3), 317\u2013329 (2006).","DOI":"10.1007\/s00233-006-0647-9"},{"key":"526_CR8","volume-title":"Ring Constructions and Applications","author":"AV Kelarev","year":"2002","unstructured":"AV Kelarev, Ring Constructions and Applications (World Scientific, River Edge, New York, 2002)."},{"issue":"1","key":"526_CR9","first-page":"51","volume":"84","author":"AV Kelarev","year":"2008","unstructured":"AV Kelarev, An algorithm for BCH codes extended with finite state automata. Fundamenta Informaticae. 84(1), 51\u201360 (2008).","journal-title":"Fundamenta Informaticae"},{"issue":"6","key":"526_CR10","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jda.2006.08.002","volume":"5","author":"AV Kelarev","year":"2007","unstructured":"AV Kelarev, Algorithms for computing parameters of graph-based extensions of BCH codes. J. Discret. Algorithm. 5(6), 553\u2013563 (2007).","journal-title":"J. Discret. Algorithm"},{"issue":"2","key":"526_CR11","first-page":"79","volume":"12","author":"AA Andrade","year":"2011","unstructured":"AA Andrade, T Shah, A Khan, A note on linear codes over semigroup rings. TEMA Tend. Mat. Apl. Comput. 12(2), 79\u201389 (2011).","journal-title":"TEMA Tend. Mat. Apl. Comput"},{"key":"526_CR12","doi-asserted-by":"publisher","unstructured":"T Shah, AA Andrade, Cyclic codes through B X ; a b \u2124 \u2265 0 $B\\left [X;\\frac {a}{b}\\mathbb {Z}_{\\geq 0}\\right ]$ a b \u2208 Q + , b = a + 1 $\\left (\\frac {a}{b}\\in Q^{+},b=a+1\\right)$ and Encoding. Discret. Math. Algoritm. Appl. 4(4) (2012). doi: http:\/\/dx.doi.org\/10.1142\/S1793830912500590 .","DOI":"10.1142\/S1793830912500590"},{"key":"526_CR13","doi-asserted-by":"publisher","unstructured":"T Shah, AA Andrade, Cyclic codes through B[ X], B X ; 1 kp , \u2124 \u2265 0 $B\\left [X;\\frac {1}{kp}, \\mathbb {Z}_{\\geq 0}\\right ]$ and B X ; 1 p k \u2124 \u2265 0 $B\\left [X;\\frac {1}{p^{k}}\\mathbb {Z}_{\\geq 0}\\right ]$ : a comparison. J. Algebra Appl. 11(4) (2012). doi: http:\/\/dx.doi.org\/10.1142\/S0219498812500788 .","DOI":"10.1142\/S0219498812500788"},{"issue":"2","key":"526_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s40314-013-0010-1","volume":"32","author":"T Shah","year":"2013","unstructured":"T Shah, Amanullah, AA Andrade, A method for improving the code rate and error correction capability of a cyclic code. Comput. Appl. Math. 32(2), 261\u2013274 (2013).","journal-title":"Comput. Appl. Math"},{"issue":"4","key":"526_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.5373\/jaram.1283.013112","volume":"4","author":"T Shah","year":"2012","unstructured":"T Shah, Amanullah, AA Andrade, A decoding procedure which improves code rate and error corrections. JARAM. 4(4), 37\u201350 (2012).","journal-title":"JARAM"},{"issue":"2","key":"526_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1590\/S1807-03022011000200006","volume":"30","author":"T Shah","year":"2011","unstructured":"T Shah, A Khan, AA Andrade, Encoding through generalized polynomial codes. Comp. Appl. Math. 30(2), 349\u2013366 (2011).","journal-title":"Comp. Appl. Math"},{"key":"526_CR17","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1016\/j.camwa.2011.05.056","volume":"62","author":"T Shah","year":"2011","unstructured":"T Shah, A Khan, AA Andrade, Constructions of codes through semigroup ring B X ; 1 2 2 , \u2124 \u2265 0 $B\\left [X;\\frac {1}{2^{2}},\\mathbb {Z}_{\\geq 0}\\right ]$ and encoding. Comput. Math. Appl. 62:, 1645\u20131654 (2011).","journal-title":"Comput. Math. Appl"},{"issue":"3","key":"526_CR18","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1590\/S0001-37652013000300002","volume":"85","author":"T Shah","year":"2013","unstructured":"T Shah, M Khan, AA Andrade, A decoding method of an n length binary BCH code through (n+1)n length binary cyclic code. Anais da Academia Brasileira de Ci\u00ea,ncias. 85(3), 863\u2013872 (2013).","journal-title":"Anais da Academia Brasileira de Ci\u00ea,ncias"},{"key":"526_CR19","volume-title":"Topics in Applied Abstract Algebra","author":"SR Nagpaul","year":"2005","unstructured":"SR Nagpaul, Sk Jain, Topics in Applied Abstract Algebra (Thomson, Brooks\/Cole, USA, 2005)."},{"key":"526_CR20","doi-asserted-by":"crossref","unstructured":"S Gao, D Panario, Tests and constructions of irreducible polynomials over finite fields, foundations of computational mathematics. (Foundations of Computational Mathematics, Cucker F, Shub M, eds.) (Springer, 1997).","DOI":"10.1007\/978-3-642-60539-0_27"},{"key":"526_CR21","volume-title":"Error correcting codes","author":"WW Peterson","year":"1972","unstructured":"WW Peterson, EJ Weddon Jr., Error correcting codes, 2nd edittion (MIT Press, Cambridge, 1972)."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-016-0526-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-016-0526-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-016-0526-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-016-0526-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T04:11:18Z","timestamp":1567570278000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-016-0526-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["526"],"URL":"https:\/\/doi.org\/10.1186\/s13638-016-0526-3","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2016,2,4]]},"article-number":"38"}}