Fernando Hernando

Helena Martín-Cruz

Des. Codes Cryptogr., September, 2024

MDS, Hermitian almost MDS, and Gilbert-Varshamov quantum codes from generalized monomial-Cartesian codes.

[BibT_eX]

[DOI]

Beatriz Barbero-Lucas

Helena Martín-Cruz

Quantum Inf. Process., March, 2024

Quantum (r,δ)-locally recoverable codes.

[BibT_eX]

[DOI]

CoRR, 2024

Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes.

[BibT_eX]

[DOI]

Markus Grassl

CoRR, 2024

2023

Steane enlargement of entanglement-assisted quantum error-correcting codes.

[BibT_eX]

[DOI]

Ryutaroh Matsumoto

Comput. Appl. Math., September, 2023

Algorithm 1033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., March, 2023

Stabilizer quantum codes defined by trace-depending polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., March, 2023

Locally recoverable codes from the matrix-product construction.

[BibT_eX]

[DOI]

CoRR, 2023

2022

On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

Optimal (r, δ)-LRCs from zero-dimensional affine variety codes and their subfield-subcodes.

[BibT_eX]

[DOI]

Helena Martín-Cruz

CoRR, 2022

2021

Entanglement-assisted quantum error-correcting codes from RS codes and BCH codes with extension degree 2.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2021

Correction to: Entanglement-assisted quantum error-correcting codes over arbitrary finite fields.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2021

2020

Quantum codes from a new construction of self-orthogonal algebraic geometry codes.

[BibT_eX]

[DOI]

Julio José Moyano-Fernández

Francisco Monserrat

Quantum Inf. Process., 2020

Locally recoverable J-affine variety codes.

[BibT_eX]

[DOI]

Carlos Munuera

Finite Fields Their Appl., 2020

Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes.

[BibT_eX]

[DOI]

IEEE Access, 2020

2019

Algorithm 994: Fast Implementations of the Brouwer-Zimmermann Algorithm for the Computation of the Minimum Distance of a Random Linear Code.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2019

Classical and Quantum Evaluation Codes at the Trace Roots.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

New Binary and Ternary LCD Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Entanglement-assisted quantum error-correcting codes over arbitrary finite fields.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2019

Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Multicomputers.

[BibT_eX]

[DOI]

CoRR, 2019

Locally recoverable J-affine variety codes.

[BibT_eX]

[DOI]

Carlos Munuera

CoRR, 2019

2018

Improved Constructions of Nested Code Pairs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Quasi-cyclic constructions of quantum codes.

[BibT_eX]

[DOI]

Ryutaroh Matsumoto

Finite Fields Their Appl., 2018

2017

On the distance of stabilizer quantum codes from J-affine variety codes.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2017

2016

Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code.

[BibT_eX]

[DOI]

CoRR, 2016

On the distance of stabilizer quantum codes from J-affine variety codes.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Stabilizer quantum codes from J-affine variety codes and a new Steane-like enlargement.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2015

New quantum codes from evaluation and matrix-product codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Quantum codes from affine variety codes and their subfield-subcodes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Stabilizer quantum codes from J-affine variety codes and a new Steane-like enlargement.

[BibT_eX]

[DOI]

CoRR, 2015

2013

The dimension of subcode-subfields of shortened generalized Reed-Solomon codes.

[BibT_eX]

[DOI]

Kyle Marshall

Michael E. O'Sullivan

Des. Codes Cryptogr., 2013

On the Classification of Exceptional Planar Functions over $\mathbb{F}_{p}$

[BibT_eX]

[DOI]

Francisco Monserrat

CoRR, 2013

List decoding of repeated codes.

[BibT_eX]

[DOI]

Michael E. O'Sullivan

Appl. Algebra Eng. Commun. Comput., 2013

On The Classification of Perfect Nonlinear (PN) and Almost Perfect Nonlinear (APN) Monomial Functions.

[BibT_eX]

Proceedings of the Finite Fields and Their Applications - Character Sums and Polynomials., 2013

2012

Proof of a conjecture of Segre and Bartocci on monomial hyperovals in projective planes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

List decoding of matrix-product codes from nested codes: An application to quasi-cyclic codes.

[BibT_eX]

[DOI]

Tom Høholdt

Adv. Math. Commun., 2012

2011

Decoding of Matrix-Product Codes

[BibT_eX]

[DOI]

CoRR, 2011

2010

New linear codes from matrix-product codes with polynomial units.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

Subfield-subcodes of Generalized Toric codes.

[BibT_eX]

[DOI]

Michael E. O'Sullivan

Emanuel M. Popovici

Shraddha Srivastava

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Proof of a Conjecture on the Sequence of Exceptional Numbers, Classifying Cyclic Codes and APN Functions

[BibT_eX]

[DOI]

CoRR, 2009

Construction and decoding of matrix-product codes from nested codes.

[BibT_eX]

[DOI]

Kristine Lally

Appl. Algebra Eng. Commun. Comput., 2009

2008

Sixteen New Linear Codes With Plotkin Sum

[BibT_eX]

[DOI]