Cyclotomic Trace Codes
Department of Mathematics, University of Rijeka, Radmile Matejčić 2, 51000 Rijeka, Croatia
Department of Mathematical Sciences, Michigan Technological University, Houghton, MI 49931, USA
Author to whom correspondence should be addressed.
Received: 20 June 2019 / Revised: 3 August 2019 / Accepted: 10 August 2019 / Published: 13 August 2019
PDF [249 KB, uploaded 13 August 2019]
A generalization of Ding’s construction is proposed that employs as a defining set the collection of the s
th powers (
) of all nonzero elements in
is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over
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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Crnković, D.; Švob, A.; Tonchev, V.D. Cyclotomic Trace Codes. Algorithms 2019, 12, 168.
Crnković D, Švob A, Tonchev VD. Cyclotomic Trace Codes. Algorithms. 2019; 12(8):168.
Crnković, Dean; Švob, Andrea; Tonchev, Vladimir D. 2019. "Cyclotomic Trace Codes." Algorithms 12, no. 8: 168.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.