BINARY LINEAR CODES FROM SIMPLE GRAPHS
Binary linear code C generated by a simple graph ? = (V,E) on n vertices is the linear code generated by [In|A] where In is the identity matrix of size n and A is the adjacency matrix of ?. The minimum distance of C can be found using the function von which maps set of vertices S of ? to another...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/72980 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |