The main aim of this paper is to introduce the relationship between the topic of coding theory and the projective plane of order three. The maximum value of size of code over finite field of order three and an incidence matrix with the parameters,  (length of code),  (minimum distance of code) and  (error-correcting of code ) have been constructed. Some examples and theorems have been given.

In this paper, we offer and study a novel type generalized soft-open sets in topological spaces, named soft Æ„c-open sets. Relationships of this set with other types of generalized soft-open sets are discussed, definitions of soft Æ„ , soft bc- closure and soft bc- interior are introduced, and its properties are investigated. Also, we introduce and explore several characterizations and properties of this type of sets.

In this paper we define a signal soft set as a mathematical tool to represent and study atoms, anti-atoms, electrons, anti-electrons, protons, and anti-protons, and generate a signal soft topology, with an example of signal soft topology on H₂O.

In this paper, we introduce and study new types of soft open sets and soft closed
sets in soft bitopological spaces (X,~ ,~ ,E) 1 2   , namely, (1,2)*-maximal soft open
sets, (1,2)*-maximal soft (1,2)*-pre-open sets, semi (1,2)*-maximal soft (1,2)*-preopen
sets, (1,2)*-maximal soft closed sets, (1,2)*-maximal soft (1,2)*-pre-closed
sets, (1,2)*-minimal soft open sets, (1,2)*-minimal soft (1,2)*-pre-open sets, (1,2)*-
minimal soft closed sets, (1,2)*-minimal soft (1,2)*-pre-closed sets, and semi (1,2)*-
minimal soft (1,2)*-pre-closed sets. Also, properties and the relation among these
concepts have been studied.

 In this paper, we introduce  and  study  new  classes of soft  open  sets  in soft bitopological spaces called soft  (1,2)*-omega  open  sets  and  weak forms of soft (1,2)*-omega open sets such as soft  (1,2)*-α-ω-open sets, soft  (1,2)*-pre-ω-opensets, soft  (1,2)*-b-ω-open sets,  and  soft  (1,2)*-β-ω-open  sets. Moreover; some basic properties and the relation among these concepts and other concepts also have been studied.

After Zadeh introduced the concept of z-number scientists in various fields have shown keen interest in applying this concept in various applications. In applications of z-numbers, to compare two z-numbers, a ranking procedure is essential.  While a few ranking functions have been already proposed in the literature there is a need to evolve some more good ranking functions.  In this paper, a novel ranking function for z-numbers is proposed- "the Momentum Ranking Function"(MRF). Also, game theoretic problems where the payoff matrix elements are z-numbers are considered and the application of the momentum ranking function in such problems is demonstrated.