| Binary Linear Codes: New Results on Nonexistence (1996) | |||||||||||||||
Abstract | |||||||||||||||
| ly, a constraint is a relation of the form a 1 v 1 + · · · +a n v n k, where v 1 , . . . , v n are variables, a 1 , . . . , a n # Q , k # Z, and is either #, #, or =. Constraints are represented in several different ways, according to what variables and coefficients are allowed: 1. When constraints appear in commands, the variables are arbitrary (within the confines of the language), and the coefficients are in Z. 2. These constraints are internally represented (using the "constraint" class) in the same way, except that Q -coefficients are allowed. This is because some internal operations may result in constraints whose coefficients are not integers. (This can happen when the "incorporate" command is used.) 3. For split linear programming calculations, constraints are first converted to constraints involving v variables and having coefficients in Q (class qvconstraint). 4. Clearing denominators yields constraints having v variables and coefficients in Z (class vconstra... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||