%0 Journal Article
%T Cyclotomic Trace Codes
%J Algorithms | An Open Access Journal from MDPI
%D 2019
%R https://doi.org/10.3390/a12080168
%X A generalization of Ding¡¯s construction is proposed that employs as a defining set the collection of the sth powers ( s ¡Ý 2 ) of all nonzero elements in G F ( p m ) , where p ¡Ý 2 is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over G F ( 4 ) that give rise to optimal or near optimal quantum codes. In addition, the codes yield interesting combinatorial structures, such as strongly regular graphs and block designs. View Full-Tex
%U https://www.mdpi.com/1999-4893/12/8/168