{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:27:44Z","timestamp":1648974464591},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:p> The frequency spectrums are inefficiently utilized and cognitive radio has been proposed for full utilization of these spectrums. The central idea of cognitive radio is to allow the secondary user to use the spectrum concurrently with the primary user with the compulsion of minimum interference. However, designing a model with minimum interference is a challenging task. In this paper, a transmission model based on cyclic generalized polynomial codes discussed in [2] and [15], is proposed for the improvement in utilization of spectrum. The proposed model assures a non interference data transmission of the primary and secondary users. Furthermore, analytical results are presented to show that the proposed model utilizes spectrum more efficiently as compared to traditional models. <\/jats:p>","DOI":"10.1142\/s1793830914500591","type":"journal-article","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T21:37:32Z","timestamp":1408397852000},"page":"1450059","source":"Crossref","is-referenced-by-count":2,"title":["A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction"],"prefix":"10.1142","volume":"06","author":[{"given":"Naveed Ahmed","family":"Azam","sequence":"first","affiliation":[{"name":"Faculty of Engineering Sciences, Ghulam Ishaq Khan Institute of Engineering Science and Technology, Topi Swabi, Pakistan"}]},{"given":"Tariq","family":"Shah","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Quaid-i-Azam University, Islamabad, Pakistan"}]},{"given":"Antonio Aparecido","family":"de Andrade","sequence":"additional","affiliation":[{"name":"Department of Mathematics, S\u00e3o Paulo State University at S\u00e3o Jos\u00e9 do Rio Preto \u2013 SP, Brazil"}]}],"member":"219","published-online":{"date-parts":[[2014,10,10]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.05.001"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.12.080400"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.111510.00108"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070402"},{"key":"rf6","volume-title":"Commutative Semigroup Rings","author":"Gilmer R.","year":"1984"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2015717"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.839380"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:47:08Z","timestamp":1565081228000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,10]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2014,10,10]]},"published-print":{"date-parts":[[2014,12]]}},"alternative-id":["10.1142\/S1793830914500591"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500591","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,10]]}}}