Abstract

The purpose of this article is to indicate the importance of using close planar rings in the construction of high efficiency balanced incomplete block (BIBD) plans, and how these can be used to encrypting the image. Therefore, an algorithm of a program to compute the incidence matrix plays a very important role in encrypting and decrypting images.

Citation details of the article

Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 31
Issue: 2
Year: 2018

DOI: 10.12732/ijam.v31i2.9

Download Section

Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

1. [1] A. Boua, L. Oukhtite, A. Raji & O. Ait Zemzami, An algorithm to construct error correcting codes from planar near-rings, Inter. J. of Math. Engineering & Sci., 3, No 1, (2014), 14-23.
2. [2] J.R. Clay, Generating balanced incomplete block designs from planar nearrings, J. Algebra, 22 (1972), 319-331.
3. [3] J.R. Clay, Geometric and combinatorial ideas related to circular planar nearrings, Bull. of the Institute of Math. Academia Sinica, 16 (1988), 275-283.
4. [4] J.R. Clay, Near-rings: Geneses and Applications, Oxford University Press, 1992.
5. [5] J.R. Clay, Geometry in fields, Algebra Colloq., 1, No 4 (1994), 289-306.
6. [6] P. Fuchs, G. Hofer & G. Pilz, Codes from planar near-rings, IEEE Trans. Inform. Theory, 36 (1990), 647-651.
7. [7] G. Pilz, Near-rings, North Holland and American Elsevier, Amsterdam, 2nd Revis. Ed. (1983).