On the dual distance and the gap of a binary code
P Solé, JP Tillicb - Discrete mathematics, 1998 - Elsevier
P Solé, JP Tillicb
Discrete mathematics, 1998•ElsevierThe 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.
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.
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.
Elsevier
Showing the best result for this search. See all results