Shah, TariqAmanullah,de Andrade, Antonio Aparecido [UNESP]2014-05-272014-05-272013-07-01Computational and Applied Mathematics, v. 32, n. 2, p. 261-274, 2013.0101-82051807-0302http://hdl.handle.net/11449/75750Currently, 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.261-274engBinary cyclic codeBinary Hamming codePolynomial ringSemigroup ringArtigo10.1007/s40314-013-0010-1WOS:000320665200005Acesso restrito2-s2.0-848792072868940498347481982