Cyclic Codes with Unequal Symbol Protection

The authors offer a method of constructing binary cyclic nonsystematic codes in which part of the information symbols are protected from a greater number of errors than that which the code distance can provide. The resultant codes permit majority decoding.