A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble

Abstract: We present an explicit construction of a sequence of rate

1 / 2

Wozencraft ensemble codes (over any fixed finite field

m a t h b b F_{q}

) that achieve minimum distance

O m e g a (s q r t k)

where

k

is the message length. The coefficients of the Wozencraft ensemble codes are constructed using Sidon Sets and the cyclic structure of

m a t h b b F_{q^{k}}

where

k + 1

is prime with

q

a primitive root modulo

k + 1

. Assuming Artin's conjecture, there are infinitely many such

k

for any prime power

q

.

This page was built for publication: A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble