Title of article :
A new upper bound for binary codes with minimum distance four
Author/Authors :
Jun Kyo Kim، نويسنده , , Sang Geun Hahn، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Pages :
5
From page :
291
To page :
295
Abstract :
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 length n with minimum distance d between codewords.
Journal title :
Discrete Mathematics
Serial Year :
1998
Journal title :
Discrete Mathematics
Record number :
951088
Link To Document :
بازگشت