CONSTRUCTION OF LINEAR CODE FROM SUDOKU GRAPH
A linear code is very important part in a telecommunication route. Tonchev (2002) showed that we can construct a code from graph with parameters meet the Gilbert-Varshamov bound. In this project, we investigate a linear code formed from sudoku graphs. In addition, we also show an analysis of the...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/19160 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | A linear code is very important part in a telecommunication route. Tonchev
(2002) showed that we can construct a code from graph with parameters meet the
Gilbert-Varshamov bound.
In this project, we investigate a linear code formed from sudoku graphs. In
addition, we also show an analysis of the Permutation Decoding of the codes. |
|---|