Edgar Martínez-Moro

Orcid: 0000-0003-1243-2049

Affiliations:
  • University of Valladolid, Institute of Mathematics


According to our database1, Edgar Martínez-Moro authored at least 78 papers between 1999 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Locally recoverable codes from towers of function fields.
Finite Fields Their Appl., February, 2024

On the structure of repeated-root polycyclic codes over local rings.
Discret. Math., January, 2024

2023
The Hull of Two Classical Propagation Rules and Their Applications.
IEEE Trans. Inf. Theory, October, 2023

Galois LCD codes over mixed alphabets.
Finite Fields Their Appl., 2023

(σ, δ)-polycyclic codes in Ore extensions over rings.
CoRR, 2023

Single Server Private Information Retrieval Protocols With Codes Over Rings.
CoRR, 2023

On 𝓁-MDS codes and a conjecture on infinite families of 1-MDS codes.
CoRR, 2023

On LCP codes over a mixed ring alphabet.
CoRR, 2023

On LCP and checkable group codes over finite non-commutative Frobenius rings.
CoRR, 2023

Complete Gröbner basis for lattice codes.
CoRR, 2023

2022
Hulls of cyclic serial codes over a finite chain ring.
Finite Fields Their Appl., 2022

A transform approach to polycyclic and serial codes over rings.
Finite Fields Their Appl., 2022

Abelian and consta-Abelian polyadic codes over affine algebras with a finite commutative chain coefficient ring.
CoRR, 2022

Public key cryptography based on skew dihedral group rings.
CoRR, 2022

Free Resolutions and Generalized Hamming Weights of binary linear codes.
CoRR, 2022

Lifted codes and lattices from codes over finite chain rings.
Cryptogr. Commun., 2022

Computing generalized hamming weights of binary linear codes via free resolutions.
ACM Commun. Comput. Algebra, 2022

Private Information Retrieval Schemes Using Cyclic Codes.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021
Cyclic codes over a non-chain ring <i>R</i><sub><i>e</i>, <i>q</i></sub> and their application to LCD codes.
Discret. Math., 2021

Private Information Schemes Using Cyclic Codes.
CoRR, 2021

On decoding hyperbolic codes.
CoRR, 2021

Cyclic codes over a non-chain ring R<sub>e, q</sub> and their application to LCD codes.
CoRR, 2021

Galois hulls of cyclic serial codes over a finite chain ring.
CoRR, 2021

2020
Vardøhus Codes: Polar Codes Based on Castle Curves Kernels.
IEEE Trans. Inf. Theory, 2020

Galois correspondence on linear codes over finite chain rings.
Discret. Math., 2020

Computing sharp recovery structures for locally recoverable codes.
Des. Codes Cryptogr., 2020

Linear complementary pair of group codes over finite chain rings.
Des. Codes Cryptogr., 2020

Do non-free LCD codes over finite commutative Frobenius rings exist?
Des. Codes Cryptogr., 2020

Foreword - Special Issue: Codes, Cryptology and Curves in honour of Ruud Pellikaan.
Des. Codes Cryptogr., 2020

On polycyclic codes over a finite chain ring.
Adv. Math. Commun., 2020

2019
Linear Complementary Pair Of Abelian Codes over Finite Chain Rings.
CoRR, 2019

Computing an Invariant of a Linear Code.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2018
Foreword.
Math. Comput. Sci., 2018

On the Weak Order Ideal Associated to Linear Codes.
Math. Comput. Sci., 2018

Codes over affine algebras with a finite commutative chain coefficient ring.
Finite Fields Their Appl., 2018

Additive cyclic codes over finite commutative chain rings.
Discret. Math., 2018

On counting subring-submodules of free modules over finite commutative frobenius rings.
Des. Codes Cryptogr., 2018

2017
Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over $\mathbb{F}_4$.
CoRR, 2017

2016
On Counting Subring-Subcodes of Free Linear Codes Over Finite Principal Ideal Rings.
CoRR, 2016

On the ideal associated to a linear code.
Adv. Math. Commun., 2016

2015
Foreword: Computer Algebra in Coding Theory and Cryptography.
Des. Codes Cryptogr., 2015

Linear codes over Z<sub>4</sub>[x]/<x<sup>2</sup>-2x>: dual preserving maps and images as codes over Z<sub>4</sub>.
ACM Commun. Comput. Algebra, 2015

Multivariable codes in principal ideal polynomial quotient rings.
ACM Commun. Comput. Algebra, 2015

The degree compatible Gröbner fan for linear codes.
ACM Commun. Comput. Algebra, 2015

2014
Computational aspects of retrieving a representation of an algebraic geometry code.
J. Symb. Comput., 2014

On additive modular bivariate codes over 𝔽<sub>4</sub>.
Finite Fields Their Appl., 2014

On the Composition of Secret Sharing Schemes Related to codes.
Discret. Math. Algorithms Appl., 2014

On the unique representation of very strong algebraic geometry codes.
Des. Codes Cryptogr., 2014

On zero neighbours and trial sets of linear codes.
CoRR, 2014

On the Fan Associated to a Linear Code.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013
Corrigendum to "On trace codes and Galois invariance over finite commutative chain rings" [Finite Fields and Their Applications 22 (2013) 114-121].
Finite Fields Their Appl., 2013

On trace codes and Galois invariance over finite commutative chain rings.
Finite Fields Their Appl., 2013

Additive semisimple multivariable codes over $${\mathbb{F}_4}$$.
Des. Codes Cryptogr., 2013

The non-gap sequence of a subcode of a generalized Reed-Solomon code.
Des. Codes Cryptogr., 2013

Foreword: computer algebra in coding theory and cryptography.
Appl. Algebra Eng. Commun. Comput., 2013

2012
Foreword.
Math. Comput. Sci., 2012

Decomposition of Modular Codes for Computing Test Sets and Graver Basis.
Math. Comput. Sci., 2012

Computing coset leaders and leader codewords of binary codes
CoRR, 2012

2011
Algebraic structure of the minimal support codewords set of some linear codes.
Adv. Math. Commun., 2011

2010
Special issue algebraic coding theory and applications.
J. Symb. Comput., 2010

Monomial-like codes
CoRR, 2010

Computing coset leaders of binary codes
CoRR, 2010

An algebraic view to gradient descent decoding.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Gröbner Representations of Binary Matroids.
Proceedings of the Applied Algebra, 2009

Mattson Solomon Transform and Algebra Codes.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

An Application of Möller's Algorithm to Coding Theory.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Gröbner bases and combinatorics for binary codes.
Appl. Algebra Eng. Commun. Comput., 2008

2007
On repeated-root multivariable codes over a finite chain ring.
Des. Codes Cryptogr., 2007

2006
Multivariable Codes Over Finite Chain Rings: Serial Codes.
SIAM J. Discret. Math., 2006

A General Framework for Applying FGLM Techniques to Linear Codes.
Proceedings of the Applied Algebra, 2006

2005
On the Use of Gröbner Bases for Computing the Structure of Finite Abelian Groups.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
A generalization of Niederreiter-Xing's propagation rule and its commutativity with duality.
IEEE Trans. Inf. Theory, 2004

Regular representations of finite-dimensional separable semisimple algebras and Gróbner bases.
J. Symb. Comput., 2004

2003
Compounding Secret Sharing Schemes.
IACR Cryptol. ePrint Arch., 2003

2002
Properties of Commutative Association Schemes Derived by Fglm Techniques.
Int. J. Algebra Comput., 2002

2001
Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps.
Proceedings of the Cryptography and Coding, 2001

1999
Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics.
Proceedings of the Cryptography and Coding, 1999

Computations on Character Tables of Association Schemes.
Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, 1999


  Loading...