In a linear (n, k) code, a set of k coordinates is said to be an information set for the code if the projection map onto those k coordinates is a vector space isomorphism. Extended (cyclic)… (More)

A binary codeword is a vector v = (a0 a1 . . . an) ∈ F 2 that is used to transmit information. Note that v naturally corresponds to the polynomial v(x) = a0 + a1x+ a2x 2 + . . .+ anx n ∈ F2[x]. Thus,… (More)

A new algorithm is presented for finding codewords that are of low weight (“light”) and low degree (“short”) in narrow-sense binary BCH codes of length n = 2 1 and minimum weight d = 2 1, for use in… (More)