A NOTE ON LINEAR CODES FROM JOHNSON GRAPHS
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.
graphs, linear codes, extremal codes, nearly-extremal codes.
