#TITLE_ALTERNATIVE#
Binary linear code can be defined by constructing generator matrix from adjacency matrix of undirected graphs. A binary linier code which is constructed by a high dimensional adjacency matrix of undirected graf will always accomplish Gilbert-Varshamov bound. It is well-known that from strongly regul...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/16934 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |