Abstract:
In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over F2R with respect to the Chinese Euclidean distance.Metadata
Abstract:
In this letter, we determine the bounds on covering radius of repetition codes, simplex codes and MacDonald codes over F2R with respect to the Chinese Euclidean distance.
Published in: IEEE Communications Letters ( Volume: 25, Issue: 1, January 2021)