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: | , |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
2015
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/5067 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | De La Salle University |
語言: | English |