Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binary linear code with word length n and dimension k, are shown
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...
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...
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...
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...
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...
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...
Combining Delsarte's (1973) linear programming bound with the information that certain weights canno...
DOI
Add to ORKG