Add to ORKGIn this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords.This can lead to a big improvement of the computation time for finding the minimum distance of a code.We have also considered the usefulness of combinatorial 2-(t,k,1) designs when there are memory limitations to the number of objects (linear codes in particular) that can be tested for equivalence.</p
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...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
In this paper we show the usability of the Gray code with constant weight words for computing linear...
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming dista...
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 ...
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming dista...
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...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
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...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
In this paper we show the usability of the Gray code with constant weight words for computing linear...
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming dista...
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 ...
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming dista...
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...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
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...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...