Home › Researcher directory › Thomas Aaron Gulliver
Thomas Aaron Gulliver
Affiliation : University of Victoria
- 32Publications (affiliation in Canada)
- 979Total publications
- 10741Citations
- 44h-index
Research profile
Thomas Aaron Gulliver has 32 indexed publications (2012–2024). Their work appears mainly in “arXiv (Cornell University)”, “Lecture notes in computer science” and “Journal of Applied Mathematics and Computing”. Their most cited article, “Constructions of good entanglement-assisted quantum error correcting codes” (2017), has been cited 256 times. 2 of these publications date from the last three years of activity. Their work is co-authored with at least 2 researchers, including institutions in Algeria.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Coding theory and cryptography
- Error Correcting Code Techniques
- Advanced Wireless Communication Techniques
- Ultra-Wideband Communications Technology
- Indoor and Outdoor Localization Technologies
Publications (32)
- LCD codes over finite fields
- Constacyclic and quasi-twisted codes over $ \mathbb{Z}_{q}[u]/\langle u^{2}-1\rangle $ and new $ \mathbb{Z}_4 $-linear codes
- Some skew constacyclic codes over $$\mathbb {F}_{q}+u\mathbb {F}_{q}$$
- New classes of codes over $$R_{q,p,m}={\mathbb {Z}}_{p^{m}}[u_{1}, u_{2}, \ldots , u_{ q}]/\left\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\right\rangle $$ and their applications
- Greedy construction of DNA codes and new bounds
- Some new constructions of isodual and LCD codes over finite fields
- Constructions of good entanglement-assisted quantum error correcting codes
- Constacyclic Codes over Finite Principal Ideal Rings
- On Isodual Cyclic Codes over Finite Chain Rings
- On codes over $$\mathbb {F}_{q}+v\mathbb {F}_{q}+v^{2}\mathbb {F}_{q}$$ F q + v F q + v 2 F q
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- Constacyclic Codes over Finite Principal Ideal Rings
- On Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
- A New Variant of the McEliece Cryptosystem Based on QC-LDPC and QC-MDPC Codes
- Algebraic quantum synchronizable codes
- Simplex and MacDonald codes over $$R_{q}$$ R q
- Equivalence of Quasi-cyclic Codes over Finite Fields
- Extending Construction X for Quantum Error-Correcting Codes
- Repeated-Root Isodual Cyclic Codes over Finite Fields
- Greedy Construction of DNA Codes and New Bounds
- On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields
- Quantum codes over rings
- Repeated root constacyclic codes of length mps over 𝔽pr + u𝔽pr + ⋯ + ue-1𝔽pr
- Construction of cyclic codes over $$\mathbb F _2+u\mathbb F _2$$ F 2 + u F 2 for DNA computing
- SYMMETRIC AND ASYMMETRIC QUANTUM CODES
- MDS and self-dual codes over rings
- On self-dual cyclic codes over finite chain rings
- Self-dual repeated root cyclic and negacyclic codes over finite fields
- Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields
- On the permutation groups of cyclic codes
- Lexicodes over Rings
- Greedy codes over Z4
Publication venues
- arXiv (Cornell University) × 6
- Lecture notes in computer science × 3
- Journal of Applied Mathematics and Computing × 3
- Advances in Mathematics of Communications × 2
- Computational and Applied Mathematics × 2
- Applicable Algebra in Engineering Communication and Computing × 2
Publications per year
- 20241
- 20231
- 20211
- 20201
- 20192
- 20177
- 20164
- 20154
- 20142
- 20132
Collaborations
Partner institutions : University of Sciences and Technology Houari Boumediene
Co-authors’ countries : Algeria
Co-authors
Bibliographic data from OpenAlex (open database).
Why choose Dzcademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.