Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647018 | Discrete Mathematics | 2015 | 16 Pages |
Abstract
We construct a lot of new [n,5,d]5[n,5,d]5 codes close to the Griesmer bound and prove the nonexistence of some Griesmer codes to determine the exact value of n5(5,d)n5(5,d) or to improve the known upper bound on n5(5,d)n5(5,d), where nq(k,d)nq(k,d) is the minimum length nn for which an [n,k,d]q[n,k,d]q code exists. We also give the updated table for n5(5,d)n5(5,d) for all dd except some known cases.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Iliya Bouyukliev, Yuuki Kageyama, Tatsuya Maruta,