Please use this identifier to cite or link to this item:
|Title:||Meeting the Levenshtein bound with equality by weighted-correlation complementary set||Authors:||Liu, Zi Long
Guan, Yong Liang
|Keywords:||DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory||Issue Date:||2012||Source:||Liu, Z. L., & Guan, Y. L. (2012). Meeting the Levenshtein bound with equality by weighted-correlation complementary set. 2012 IEEE International Symposium on Information Theory (ISIT), pp.1010-1013.||Abstract:||Levenshtein improved the Welch bound on aperiodic correlation by weighting the cyclic shifts of the sequences over complex roots-of-unity. Although many works have been concerned on meeting the Welch bound with equality, no such effort has been reported for the Levenshtein bound. We show that the Levenshtein bound with equality is met if and only if the non-trivial aperiodic correlations have identical amplitude for all time-shifts, and the sequences form a novel class of complementary set whose aperiodic correlation is defined as the conventional aperiodic correlation modulated by a simplex weighting vector.||URI:||https://hdl.handle.net/10356/102566
|DOI:||http://dx.doi.org/10.1109/ISIT.2012.6282286||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.