Abstract | ||
---|---|---|
In this article, we define the binary codes of tournament matrices in the class 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) can be sorted uniquely between matrices with minimum and maximum binary codes. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.dam.2014.02.019 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Binary code,Tournament matrix,Generating algorithm | Discrete mathematics,Combinatorics,Tournament,Matrix (mathematics),Binary code,Mathematics | Journal |
Volume | ISSN | Citations |
171 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ilhan Hacioglu | 1 | 0 | 1.01 |
Burak Kurkcu | 2 | 3 | 1.21 |