JP Journal of Algebra, Number Theory and Applications
Volume 38, Issue 5, Pages 473 - 488
(October 2016) http://dx.doi.org/10.17654/NT038050473 |
|
A NOTE ON LINEAR CODES FROM JOHNSON GRAPHS
Djoko Suprijanto and Teguh Nugraha
|
Abstract: To construct linear codes having minimum distance as large as possible, for any given length and dimension is one of the major problems in coding theory. In this paper, we show the adequacy of Dougherty et al.’s method [2] by providing many numerical evidences. We obtain many extremal or nearly-extremal linear codes over several finite fields for modest lengths. |
Keywords and phrases: graphs, linear codes, extremal codes, nearly-extremal codes. |
|
Number of Downloads: 456 | Number of Views: 1910 |
|