Construction of [2k-1+k, k, 2k-1+1] Codes Attaining Griesmer Bound and Its Locality (Griesmer 한계식을 만족하는 [2k-1+k, k, 2k-1+1] 부호 설계 및 부분접속수 분석)
-
- The Journal of Korean Institute of Communications and Information Sciences
- /
- v.40 no.3
- /
- pp.491-496
- /
- 2015