A simple proof of the improved Johnson bound for binary codes - 대한수학회보 - 대한수학회 :
논문 - DBpia 메뉴 건너뛰기 DBpia 전체 search 검색하기 상세검색 최근 검색 키워드가 없습니다 …

A new upper bound for binary codes with minimum distance four Jun Kyo Kim*, Sang Geun
Hahn Page 1 olscr r MATHEMATICS ELSEVIER Discrete Mathematics 187 (1998) 291-295 …

Let A (n, d) denote the maximum possible number of codewords in a binary code of length n
and minimum Hamming distance d. For large values of n, the best known upper bound, for …

Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three Page 1
Designs, Codes and Cryptography, 6, 219-227 (1995) 9 1995 Kluwer Academic Publishers …

Six New Constant Weight Binary Codes Page 1 Six New Constant Weight Binary Codes Hui
Kheng Aw Kimberly-Clark Corporation 2100 Winchester Road Neenah, Wisconsin 54956 USA …

Let A (n, d, w) be the maximum cardinality of a binary code with length n, constant weight w
(0⩽ w⩽⌊ n/2⌋) and Hamming distance d. In this paper a method is discussed in order to …

Let A (n, d) denote the maximum possible number of codewords in an (n, d) binary code. We
establish four new bounds on A (n, d), namely, A (21, 4)/spl les/43689, A (22, 4)/spl …

Let A (n, d, w) denote the maximum number of codewords in any binary constant weight
code of length n, minimum distance d and constant weight w. In this note we mention some …

The purpose of this paper is to give an upper bound for A [n, 4], the maximum number of
codewords in a binary code of word length n with minimum distance 4 between codewords …

The main goal of this dissertation is to proffer an extensive table of upper bounds on A (n, d)
with the help of the values on A (n, d, w). A (n, d) denotes the maximal number of binary …