Stephanie Perkins

Dr. Stephanie Perkins

orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2012 in Discrete Mathematics
Verified
Journal Article
Closed access
NANiema Aboluion
Niema Aboluion
Derek SmithDerek Smith
Derek Smith
SPStephanie Perkins
Stephanie Perkins

6 July 2011 in Discrete Mathematics
Verified
Journal Article
Closed access
PDF file
Derek SmithDerek Smith
Derek Smith
NANiema Aboluion
Niema Aboluion
Roberto MontemanniRoberto Montemanni
Roberto Montemanni
SPStephanie Perkins
Stephanie Perkins

1 January 1998 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AEA.E. Escott
A.E. Escott
SPStephanie Perkins
Stephanie Perkins

18 October 2010 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Derek SmithDerek Smith
Derek Smith
FHFrancis H. Hunt
Francis H. Hunt
SPStephanie Perkins
Stephanie Perkins
Spreading codes for code-division multiple-access (CDMA) systems are constructed based on Hadamard matrices and almost-bent functions. These codes can be assigned to a tessellation of hexagonal cells in such a way that codewords assigned to the same cell or to adjacent cells have zero cross-correlation. The nonzero cross-correlations in the code only apply to pairs of codewords assigned to nonadjacent cells. The codes have four times as many codewords as codes constructed from a single Hadamard matrix, which leads to significantly increased codeword re-use distances in comparison with the conventional use of a single Hadamard matrix with the same number of codewords per cell.

19 December 2008 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
Derek SmithDerek Smith
Derek Smith
RWRichard P. Ward
Richard P. Ward
SPStephanie Perkins
Stephanie Perkins

16 March 2009 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MHMatthew B. J. Higgs
Matthew B. J. Higgs
SPStephanie Perkins
Stephanie Perkins
Derek SmithDerek Smith
Derek Smith
Variable length codes offer advantages for data compression, but are susceptible to loss of synchronization if a bit error occurs. This can be mitigated by the use of variable length codes with specific mechanisms for resynchronization. Such mechanisms exist in the codes known as Huffman Equivalent (HE) codes and T-codes. These have been extensively studied in the literature. For optimal compression a length vector is obtained from the probabilities of the symbols of the alphabet used. However, HE-codes and T-codes do not exist for all length vectors. In this paper, a new class of variable length codes with good synchronization properties is developed. These are referred to as ordered termination (OT) codes. OT-codes do exist for all length vectors. Experimental results and some theoretical support suggest that OT-codes compare favorably with HE- and T-codes.