Research article of American Journal of Computer Sciences and Applications
Composed Reed Solomon Sequences Generated by ith Partial Sum of Geometrical Sequences
Dr. Ahmad Hamza Al Cheikha
Math. Sci. Dep. Col. of Arts Sci. & Edu. Ahlia Uni. Manam, Bahrain
Reed–Solomon codes are an important group of error-correcting that were introduced by Irving S. Reed and Justine Solomon in 1960. They used in the error coding control, special in systems that have two way communication channels in two externally applications: deep telecommunications and the compact disc. They have many important applications, the most prominent of which include consumer technologies such as CDs, DVDs, Blue-ray Discs, QR Codes, data transmission, technologies such as DSL and Wi MAX, broadcast, systems such as DVB and ATSC, and storage systems such as RAID 6 . They are also used in satellite communication.
This research is useful to generate new Reed Solomon Codes and their composed sequences using the ith partial sum of geometrical sequences with the bigger lengths and the bigger minimum distance that assists to increase secrecy of these information and increase the possibility of correcting mistakes resulting in the channels of communication.
Keywords: Minimal polynomial; Minimum distance; BCH Sequences; Reed-Solomon sequences; Quasi- orthogonal Sequences; Orthogonal sequences; Code; Span.
How to cite this article:
Ahmad Hamza Al Cheikha. Composed Reed Solomon Sequences Generated by ith Partial Sum of Geometrical Sequences. American Journal of Computer Sciences and Applications, 2017; 1:2. DOI: 10.28933/ajcsa-2017-09-12-01.
1. Al Cheikha,A. H., Ruchin, J. (2014), Generation of orthogonal sequences by Walsh sequences, International Journal of Soft Computing and Engineering. 4(1), 182-184.
2. Al Cheikha, A. H. (2014), Composed Short Walsh’s Sequences, American International Journal for Contemporary Scientific Research, 1(2), 81-88.
3. Al Cheikha, A. H. (2016, Feb.), Composed Reed Solomon Sequences. Paper presented at the 5th International Conference on Mathematics and Information Sciences, Cairo, Egypt, 11-13 Feb, 121-128.
4. Al Cheikha, A. H. (2016, July), Compose M-Sequences. Paper presented at Australian and New Zealand Business and Social Science Research Conference (ANZBSRC), Sydney, Australia, 17-18Sep, AJBSSIT , 3(3). (in press) ASIT
5. Al Cheikha, A. H. (2005), Generation of sets of sequences isomorphic to Walsh sequences. Qatar University Science Journal, 25, 16-30.
6. Fraleigh, J. B. (1971), A First course In Abstract Algebra. Fourth printing, USA: Addison-Wesley publishing company.
7. Gong, G., Youssef, A. M. (2002), Cryptographic properties of the Welch – Gong transformation sequence Generators. IEEE- trans. information theory, l(48), No 11, 2837-2846.
8. Jong, N.S., Golomb, S.W., Gong, G., Lee, H.K., Gaal, P. (1998), Binary pseudorandom sequences for period 2n-1 with ideal autocorrelation. IEEE Transactions Information Theory, 44(2), 814-817.
9. Lee, J. S., Miller. L. E. (1998 ), CDMA Systems Engineering Handbook. Boston, London: Artech House.
10. Lidl, R., Niederreiter, H. (1986), Introduction to Finite Fields and Their Application. USA: Cambridge University
11. Mac Williams, F. J., Sloane, N. J. A., (1978), The theory of Error- correcting Codes, Amsterdam: North- Holland Publishing Company
12. Yang, K. Kim, P. Kumar, P., (2000), Quasi-orthogonal sequences for code -division -multiple- access systems, IEEE- Trans. information theory ,vol. 46 No 3, 982-993.
This work and its PDF file(s) are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.