On the construction of some optimal binary linear codes
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n k d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2015
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/5067 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |