Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
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...
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...
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...
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 ...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
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...
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...
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...
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 ...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
In 1973 Helgert and Sfinaff published a table of upper and lower bounds on the maximum minimum-dista...
DOI
Add to ORKG