Document Type


Publication Date



Department of Mathematical Sciences


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 GF(pm), where p ≥ 2 is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over GF(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.

Publisher's Statement

©2019 by the authors. Article deposited here in compliance with publisher policies. Publisher's version of record:

Publication Title



Publisher's PDF

Included in

Mathematics Commons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.