On the dual distance and the gap of a binary code Original Research Article

The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Székely we generalize this bound to binary codes with a transitive automorphism group.