Gretchen L. Matthews

Orcid: 0000-0002-8977-8171

Affiliations:
  • Virginia Tech, Department of Mathematics, Blacksburg, VA, USA


According to our database1, Gretchen L. Matthews authored at least 51 papers between 2001 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fractional decoding of <i>r</i>-Hermitian codes.
Finite Fields Their Appl., December, 2023

Multivariate Goppa Codes.
IEEE Trans. Inf. Theory, 2023

The poset of binary CSS-T quantum codes and cyclic codes.
CoRR, 2023

Mathematical LoRE: Local Recovery of Erasures: Local recovery using polynomials, curves, surfaces, and liftings.
CoRR, 2023

Algebraic hierarchical locally recoverable codes with nested affine subspace recovery.
CoRR, 2023

Influences of some families of error-correcting codes.
CoRR, 2023

Curve-lifted codes for local recovery using lines.
CoRR, 2023

HerA Scheme: Secure Distributed Matrix Multiplication via Hermitian Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Multishot Adversarial Network Decoding.
Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022
Erasures Repair for Decreasing Monomial-Cartesian and Augmented Reed-Muller Codes of High Rate.
IEEE Trans. Inf. Theory, 2022

Relative hulls and quantum codes.
CoRR, 2022

Decreasing norm-trace codes.
CoRR, 2022

Secure MatDot codes: a secure, distributed matrix multiplication scheme.
Proceedings of the IEEE Information Theory Workshop, 2022

Norm-trace-lifted codes over binary fields.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Graph-based codes for hierarchical recovery.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Polar Decreasing Monomial-Cartesian Codes.
IEEE Trans. Inf. Theory, 2021

Hermitian-lifted codes.
Des. Codes Cryptogr., 2021

Explicit non-special divisors of small degree and LCD codes from Kummer extensions.
CoRR, 2021

Polar Coding for Information Regular Processes.
Proceedings of the 11th International Symposium on Topics in Coding, 2021

Fractional decoding of codes from Hermitian curves.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Augmented Reed-Muller Codes of High Rate and Erasure Repair.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Codes with locality from cyclic extensions of Deligne-Lusztig curves.
Des. Codes Cryptogr., 2020

Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes.
Des. Codes Cryptogr., 2020

On Laplacian monopoles.
Australas. J Comb., 2020

2019
Affine Cartesian codes with complementary duals.
Finite Fields Their Appl., 2019

Quantum Resistant Public Key Encryption Scheme HermitianRLCE.
Proceedings of the Code-Based Cryptography - 7th International Workshop, 2019

2018
Locally recoverable codes with availability <i>t</i>≥2 from fiber products of curves.
Adv. Math. Commun., 2018

Service Rate Region of Content Access from Erasure Coded Storage.
Proceedings of the IEEE Information Theory Workshop, 2018

2017
Distance colorings of hypercubes from Z<sub>2</sub>Z<sub>4</sub>-linear codes.
Discret. Appl. Math., 2017

Codes for distributed storage from 3-regular graphs.
Discret. Appl. Math., 2017

Cracking her codes: understanding shared technology resources as positioning artifacts for power and status in CSCL environments.
Int. J. Comput. Support. Collab. Learn., 2017

Locally recoverable codes from algebraic curves and surfaces.
CoRR, 2017

On the service capacity region of accessing erasure coded content.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Stopping Sets of Hermitian Codes.
IEEE Trans. Inf. Theory, 2016

Locally Recoverable Codes with Availability t≥2 from Fiber Products of Curves.
CoRR, 2016

2014
Pseudocodewords of Parity-Check Codes Over Fields of Prime Cardinality.
IEEE Trans. Inf. Theory, 2014

Exponents of polar codes using algebraic geometric code kernels.
Des. Codes Cryptogr., 2014

2011
Lifting the Fundamental Cone and Enumerating the Pseudocodewords of a Parity-Check Code.
IEEE Trans. Inf. Theory, 2011

2010
Minimum distance decoding of general algebraic geometry codes via lists.
IEEE Trans. Inf. Theory, 2010

Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes.
Des. Codes Cryptogr., 2010

2009
On irreducible no-hole <i>L</i>(2, 1)-coloring of trees.
Networks, 2009

On Weierstrass Semigroups of Some Triples on Norm-Trace Curves.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

Viewing Multipoint Codes as Subcodes of One-Point Codes.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
On the Acyclic Chromatic Number of Hamming Graphs.
Graphs Comb., 2008

2006
Acyclic colorings of products of trees.
Inf. Process. Lett., 2006

On the floor and the ceiling of a divisor.
Finite Fields Their Appl., 2006

2005
One-point codes using places of higher degree.
IEEE Trans. Inf. Theory, 2005

Weierstrass Semigroups and Codes from a Quotient of the Hermitian Curve.
Des. Codes Cryptogr., 2005

2004
Codes from the Suzuki function field.
IEEE Trans. Inf. Theory, 2004

2003
The Weierstrass Semigroup of an m-tuple of Collinear Points on a Hermitian Curve.
Proceedings of the Finite Fields and Applications, 2003

2001
Weierstrass Pairs and Minimum Distance of Goppa Codes.
Des. Codes Cryptogr., 2001


  Loading...