A method for improving the code rate and error correction capability of a cyclic code
dc.contributor.author | Shah, Tariq | |
dc.contributor.author | Amanullah, | |
dc.contributor.author | de Andrade, Antonio Aparecido [UNESP] | |
dc.contributor.institution | Quaid-i-Azam University | |
dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2014-05-27T11:29:48Z | |
dc.date.available | 2014-05-27T11:29:48Z | |
dc.date.issued | 2013-07-01 | |
dc.description.abstract | Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional. | en |
dc.description.affiliation | Department of Mathematics Quaid-i-Azam University, Islamabad | |
dc.description.affiliation | Department of Mathematics São Paulo State University, São José do Rio Preto, SP | |
dc.description.affiliationUnesp | Department of Mathematics São Paulo State University, São José do Rio Preto, SP | |
dc.format.extent | 261-274 | |
dc.identifier | http://dx.doi.org/10.1007/s40314-013-0010-1 | |
dc.identifier.citation | Computational and Applied Mathematics, v. 32, n. 2, p. 261-274, 2013. | |
dc.identifier.doi | 10.1007/s40314-013-0010-1 | |
dc.identifier.issn | 0101-8205 | |
dc.identifier.issn | 1807-0302 | |
dc.identifier.lattes | 8940498347481982 | |
dc.identifier.scopus | 2-s2.0-84879207286 | |
dc.identifier.uri | http://hdl.handle.net/11449/75750 | |
dc.identifier.wos | WOS:000320665200005 | |
dc.language.iso | eng | |
dc.relation.ispartof | Computational and Applied Mathematics | |
dc.relation.ispartofjcr | 0.863 | |
dc.relation.ispartofsjr | 0,272 | |
dc.rights.accessRights | Acesso restrito | |
dc.source | Scopus | |
dc.subject | Binary cyclic code | |
dc.subject | Binary Hamming code | |
dc.subject | Polynomial ring | |
dc.subject | Semigroup ring | |
dc.title | A method for improving the code rate and error correction capability of a cyclic code | en |
dc.type | Artigo | |
dcterms.license | http://www.springer.com/open+access/authors+rights | |
unesp.author.lattes | 8940498347481982[3] | |
unesp.author.orcid | 0000-0001-6452-2236[3] | |
unesp.campus | Universidade Estadual Paulista (Unesp), Instituto de Biociências Letras e Ciências Exatas, São José do Rio Preto | pt |