VGU RESEARCH REPOSITORY
Please use this identifier to cite or link to this item:
https://epub.vgu.edu.vn/handle/dlibvgu/1770
Title: | The ranking problem in coding theory and implementations for k-combinations with minimal changes | Authors: | Le Ba Khoa | Keywords: | Ranking problem;Coding theory;K-combinations | Issue Date: | 2023 | Abstract: | The study of different types of number sets is always an interesting topic that can contribute greatly to Computer Science. Among them, k-combination is one of the most popular topics. I was inspired by [3], the article that studies the k-combination by generating it with minimal change using graph theory. Minimal change is an interesting characteristic since it’s implemented intensively within the shaft encoder to propagate data accurately. In this paper, we are going to implement the generating algorithm from [3] through programming theories. Then with the code result, we will attempt to solve the ranking problem of the minimal change k-combination |
URI(1): | https://epub.vgu.edu.vn/handle/dlibvgu/1770 | Rights: | Attribution-ShareAlike 3.0 United States |
Appears in Collections: | Computer Science (CS) |
Files in This Item:
File | Description | Size | Format | Existing users please Login |
---|---|---|---|---|
The ranking problem in coding theory and implementations for k-combinations with minimal changes.pdf | 649.65 kB | Adobe PDF |
This item is licensed under a Creative Commons License