Gretchen Matthews

Prof. Dr. Gretchen Matthews


Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
1 March 2001 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
GMGretchen Matthews
Gretchen Matthews

8 March 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SASarah E. Anderson
Sarah E. Anderson
ECEduardo Camps-Moreno
Eduardo Camps-Moreno
HLHiram H. López
Hiram H. López
GMGretchen Matthews
Gretchen Matthews
DRDiego Ruano
Diego Ruano
ISIvan Soprunov
Ivan Soprunov
Given two $q$ -ary codes $C_{1}$ and $C_{2}$ , the relative hull of $C_{1}$ with respect to $C_{2}$ is the intersection $C_{1}\cap C_{2}^{\perp} $ . We prove that when $q>2$ , the relative hull dimension can be repeatedly reduced by one, down to a certain bound, by replacing either of the two codes with an equivalent one. The reduction of the relative hull dimension applies to hulls taken with respect to the $e$ -Galois inner product, which has as special cases both the Euclidean and Hermitian inner products. We give conditions under which the relative hull dimension can be increased by one via equivalent codes when $q>2$ . We study some consequences of the relative hull properties on entanglement-assisted quantum error-correcting codes and prove the existence of new entanglement-assisted quantum error-correcting maximum distance separable codes, meaning those whose parameters satisfy the quantum Singleton bound.

16 November 2017
Verified
Book Chapter
Closed access
PDF file
ABAlexander Barg
Alexander Barg
KHKathryn Haymaker
Kathryn Haymaker
EHEverett W. Howe
Everett W. Howe
GMGretchen Matthews
Gretchen Matthews
AVAnthony Várilly-Alvarado
Anthony Várilly-Alvarado

1 December 2005 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
GMGretchen Matthews
Gretchen Matthews

1 January 2018 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
KHKathryn Haymaker
Kathryn Haymaker
BMBeth Malmskog
Beth Malmskog
GMGretchen Matthews
Gretchen Matthews
We generalize the construction of locally recoverable codes on algebraic curves given by Barg, Tamo and Vlăduţ [4] to those with arbitrarily many recovery sets by exploiting the structure of fiber products of curves. Employing maximal curves, we create several new families of locally recoverable codes with multiple recovery sets, including codes with two recovery sets from the generalized Giulietti and Korchmáros (GK) curves and the Suzuki curves, and new locally recoverable codes with many recovery sets based on the Hermitian curve, using a fiber product construction of van der Geer and van der Vlugt. In addition, we consider the relationship between local error recovery and global error correction as well as the availability required to locally recover any pattern of a fixed number of erasures.

1 February 2005 in Journal of Pure and Applied Algebra
Verified
Journal Article
Closed access
HMHiren Maharaj
Hiren Maharaj
GMGretchen Matthews
Gretchen Matthews
GPGottlieb Pirsic
Gottlieb Pirsic