A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boolean form. This is the maximum possible number of words for length 15 and distance 5. The distance spectrum of all pairs of code words is an exact multiple of the weight spectrum of the code words
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
Conference matrices are used to construct a new infinite family of nonlinear error correcting codes ...
Following standard notation, an (n,m, d) code C denotes a binary code C which has length n, size m, ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combinatorics, Coding and Security Group (CCSG)A binary nonlinear code can be represented as a union...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
We will say that code C detects error e with probability 1 Q(e), if Q(e) is a fraction of codewor...
Nonlinear double-error-correcting block codes of length (2n − 1) (n even) are presented in this pape...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
Conference matrices are used to construct a new infinite family of nonlinear error correcting codes ...
Following standard notation, an (n,m, d) code C denotes a binary code C which has length n, size m, ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
Improved bounds forA(n,d), the maximum number of codewords in a (linear or nonlinear) binary code of...
AbstractWe estimate the maximum cardinality of binary codes (linear and nonlinear) when arbitrary re...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combinatorics, Coding and Security Group (CCSG)A binary nonlinear code can be represented as a union...
AbstractThe purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewo...
We will say that code C detects error e with probability 1 Q(e), if Q(e) is a fraction of codewor...
Nonlinear double-error-correcting block codes of length (2n − 1) (n even) are presented in this pape...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
Improved upper bounds for A(n, d), the maximum number of codewords in a binary code of word length n...
Conference matrices are used to construct a new infinite family of nonlinear error correcting codes ...
Following standard notation, an (n,m, d) code C denotes a binary code C which has length n, size m, ...