| Summary: | A generalization of Ding’s construction is proposed that employs as a defining set the collection of the <i>s</i>th powers (<inline-formula> <math display="inline"> <semantics> <mrow> <mi>s</mi> <mo>≥</mo> <mn>2</mn> </mrow> </semantics> </math> </inline-formula>) of all nonzero elements in <inline-formula> <math display="inline"> <semantics> <mrow> <mi>G</mi> <mi>F</mi> <mo>(</mo> <msup> <mi>p</mi> <mi>m</mi> </msup> <mo>)</mo> </mrow> </semantics> </math> </inline-formula>, where <inline-formula> <math display="inline"> <semantics> <mrow> <mi>p</mi> <mo>≥</mo> <mn>2</mn> </mrow> </semantics> </math> </inline-formula> is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over <inline-formula> <math display="inline"> <semantics> <mrow> <mi>G</mi> <mi>F</mi> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </semantics> </math> </inline-formula> 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.
|
|---|
