A note on codes and kets.
A note on weight enumerators of linear self-dual codes.
A reversible code over
Algorithme de Brill-Noether et codes de Goppa
Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version.
An asymptotic Gilbert-Varshamov bound for -nets.
An extremal doubly even self-dual code of length 112.
An Improvement to the Achievement of the Griesmer Bound
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper...