Construction of all tournament matrices with prescribed row sum vector

In this article, we define the binary codes of tournament matrices in the class T(R)T(R) and give unique construction algorithms for matrices which have minimum and maximum binary codes. By introducing a generating algorithm with an order we show that all matrices in class T(R)T(R) can be sorted uniquely between matrices with minimum and maximum binary codes.