CONSTRUCTION OF CODES OVER FINITE GROUPS
When constructing group block codes, there are two things to note. The first is indecomposable code. The second is a parity check matrix. As a result, determining the minimum Hamming distance of group block codes become easy.
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/34038 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |