Abstract
In recent years, soft sets have been widely used in many important decision-making real-life problems. In this paper, observing the usage of soft sets in such kind of vital problems, we have introduced the bijective-unitary bijective soft rings. Firstly, we have defined and exemplified a bijective soft ring and a unitary bijective soft ring. Moreover, we have presented some applications of bijective soft rings. We have shown the usage of bijective soft rings in coding theory. In this context, we have observed that by obtaining a bijective soft ring over a finite ring, we have a coding matrix to encode a given set of messages. Besides these applicable results, we have also obtained some relations between bijective soft and classical rings.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
