Resumen
A generalization of Ding?s construction is proposed that employs as a defining set the collection of the sth powers (??=2
s
=
2
) of all nonzero elements in ????(????)
G
F
(
p
m
)
, where ??=2
p
=
2
is prime. Some of the resulting codes are optimal or near-optimal and include projective codes over ????(4)
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.