Using some known techniques, several new binary linear codes are constructed, i.e., codes with a greater minimum distance than any previously known binary code of the same length and dimension [8]. A detailed description of one of the constructions is given
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
A new [47,15,16] linear binary block code and its weight spectrum is presented. The code is better t...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
A new [47,15,16] linear binary block code and its weight spectrum is presented. The code is better t...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
DOI
Add to ORKG