bijective

1987, James S. Royer, A Connotational Theory of Program Structure, Springer, LNCS 273, page 15, Then, by a straightforward, computable, bijective numerical coding, this idealized FORTRAN determines an EN. (Note: In this FORTRAN example, we could have omitted restrictions on I/O and instead used a computable, bijective, numerical coding for inputs and outputs to get another EN determined by FORTRAN.)

1993, Susan Montgomery, Hopf Algebras and Their Actions on Rings, American Mathematical Society, CBMS, Regional Conference Series in Mathematics, Number 83, page 124, Recent experience indicates that for infinite-dimensional Hopf algebras, the “right” definition of Galois is to require that β be bijective.

2008, B. Aslan, M. T. Sakalli, E. Bulus, Classifying 8-Bit to 8-Bit S-Boxes Based on Power Mappings, Joachim von zur Gathen, José Luis Imana, Çetin Kaya Koç (editors), Arithmetic of Finite Fields: 2nd International Workshop, Springer, LNCS 5130, page 131, Generally, there is a parallel relation between the maximum differential value and maximum LAT value for bijective S-boxes.

2012 [Introduction to Graph Theory, McGraw-Hill], Gary Chartrand, Ping Zhang, A First Course in Graph Theory, 2013, Dover, Revised and corrected republication, page 64, The proof that isomorphism is an equivalence relation relies on three fundamental properties of bijective functions (functions that are one-to-one and onto): (1) every identity function is bijective, (2) the inverse of every bijective function is also bijective, (3) the composition of two bijective functions is bijective.