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:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/19160 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |