Josep Rifà

Discret. Math., April, 2024

2022

Locally Repairable Codes Based on Permutation Cubes and Latin Squares.

[BibT_eX]

[DOI]

Ehsan Yavari

Morteza Esmaeili

IEEE Access, 2022

Z2Z4-Linear Codes

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-031-05440-2, 2022

2021

Rank and Kernel of Additive Generalized Hadamard Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On Hadamard full propelinear codes with associated group C2t˟ C2.

[BibT_eX]

[DOI]

Iván Bailera

Adv. Math. Commun., 2021

2020

On completely regular and completely transitive supplementary codes.

[BibT_eX]

[DOI]

Discret. Math., 2020

Rank and Kernel of Fp-Additive Generalised Hadamard Codes.

[BibT_eX]

[DOI]

CoRR, 2020

Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Erratum to: On Completely Regular Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2019

On Completely Regular Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2019

2018

Quasi-Hadamard Full Propelinear Codes.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2018

Hadamard full propelinear codes of type Q; rank and kernel.

[BibT_eX]

[DOI]

Emilio Suárez-Canedo

Des. Codes Cryptogr., 2018

Completely regular codes by concatenating Hamming codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2018

2017

About non equivalent completely regular codes with identical intersection array.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Completely regular codes with different parameters giving the same distance-regular coset graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Ranks and Kernels of Codes From Generalized Hadamard Matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

About some Hadamard full propelinear (2t, 2, 2)-codes. Rank and Kernel.

[BibT_eX]

[DOI]

Iván Bailera

Electron. Notes Discret. Math., 2016

2015

Construction of Hadamard ℤ2 ℤ4 Q8-Codes for Each Allowable Value of the Rank and Dimension of the Kernel.

[BibT_eX]

[DOI]

Pere Montolio

IEEE Trans. Inf. Theory, 2015

Self-embeddings of Hamming Steiner triple systems of small order and APN permutations.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Erratum to: Intersection of Hamming codes avoiding Hamming subcodes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Families of nested completely regular codes and distance-regular graphs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

2014

About a class of Hadamard propelinear codes.

[BibT_eX]

[DOI]

Emilio Suárez-Canedo

Electron. Notes Discret. Math., 2014

On a family of binary completely transitive codes with growing covering radius.

[BibT_eX]

[DOI]

Discret. Math., 2014

Families of completely transitive codes and distance transitive graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

New families of completely regular codes and their corresponding distance regular coset graphs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Hadamard \(\mathbb{Z}_{2}\mathbb{Z}_{4}Q_{8}\)-Codes: Rank and Kernel.

[BibT_eX]

[DOI]

Pere Montolio

Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013

Families of Hadamard BBZ2BBZ4Q8-Codes.

[BibT_eX]

[DOI]

Ángel del Río

IEEE Trans. Inf. Theory, 2013

On the Number of Nonequivalent Propelinear Extended Perfect Codes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Biembeddings of small order hamming STS(n) and APN monomial power permutations.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Intersection of Hamming codes avoiding Hamming subcodes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

On two families of binary quadratic bent functions

[BibT_eX]

[DOI]

CoRR, 2012

Families of Hadamard Z2Z4Q8-codes

[BibT_eX]

[DOI]

Ángel del Río

CoRR, 2012

Structural properties of binary propelinear codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2012

2011

On Lifting Perfect Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

ℤ2ℤ4-additive perfect codes in Steganography.

[BibT_eX]

[DOI]

Helena Rifà-Pous

Adv. Math. Commun., 2011

Spectrum Sharing Models in Cognitive Radio Networks.

[BibT_eX]

[DOI]

Helena Rifà-Pous

Proceedings of the 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2011

2010

New completely regular q-ary codes based on Kronecker products.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Z2Z4-linear codes: generator matrices and duality.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Product Perfect Z2Z4-linear codes in Steganography

[BibT_eX]

[DOI]

CoRR, 2010

On linear q-ary completely regular codes with rho=2 and dual antipodal

[BibT_eX]

[DOI]

CoRR, 2010

Perfect Z2Z4-linear codes in Steganography

[BibT_eX]

[DOI]

Helena Rifà

CoRR, 2010

On q-ary linear completely regular codes with ρ=2 and antipodal dual.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

Product perfect Z2 Z4-linear codes in steganography.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009

On the Intersection of BBZ2BBZ4-Additive Hadamard Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Construction of BBZ4-Linear Reed-Muller Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Product perfect codes and steganography.

[BibT_eX]

[DOI]

Helena Rifà-Pous

Digit. Signal Process., 2009

On a class of binary linear completely transitive codes with arbitrary covering radius.

[BibT_eX]

[DOI]

Discret. Math., 2009

Propelinear structure of Z_{2k}-linear codes

[BibT_eX]

[DOI]

CoRR, 2009

On linear completely regular codes with covering radius rho=1. Construction and classification

[BibT_eX]

[DOI]

CoRR, 2009

Construction of Additive Reed-Muller Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2009

2008

On the Intersection of Z2Z4-Additive Perfect Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On non-antipodal binary completely regular codes.

[BibT_eX]

[DOI]

Discret. Math., 2008

Construction of Z4-linear Reed-Muller codes

[BibT_eX]

[DOI]

CoRR, 2008

On the Kronecker Product Construction of Completely Transitive q-Ary Codes.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

On new completely regular q-ary codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2007

Z2Z4-linear codes: generator matrices and duality

[BibT_eX]

[DOI]

CoRR, 2007

Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

2006

On the additive (ℤ4-linear and non-ℤ4-linear) Hadamard codes: rank and kernel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On the intersection of additive perfect codes

[BibT_eX]

[DOI]

CoRR, 2006

Hadamard Codes of Length 2ts (s Odd). Rank and Kernel.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

2005

Rank and kernel of binary Hadamard codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Kernels and p-Kernels of pr-ary 1-Perfect Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2003

On Z4-linear Preparata-like and Kerdock-like code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

2002

On binary 1-perfect additive codes: Some structural properties.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

Nonexistence of completely transitive codes with error-correcting capability e>3.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Every Z2k-Code is a Binary Propelinear Code.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On completely regular binary codes and t-designs*.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

1-Perfect Uniform and Distance Invariant Partitions.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

2000

On the nonexistence of completely transitive codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Efficient construction of vote-tags to allow open objection to the tally in electronic elections.

[BibT_eX]

[DOI]

Andreu Riera

Inf. Process. Lett., 2000

1999

A characterization of 1-perfect additive codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

On the Characterization of Linear Uniquely Decodable Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1999

1998

A New Algebraic Algorithm to Decode the Ternary Golay Code.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

1997

Translation-invariant propelinear codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Large scale elections by coordinating electoral colleges.

[BibT_eX]

Andreu Riera

Proceedings of the Information Security in Research and Business, 1997

1996

An implementable secure voting scheme.

[BibT_eX]

[DOI]

Comput. Secur., 1996

1995

Groups of complex integers used as QAM signals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

1993

A note about multidesigns and extended designs.

[BibT_eX]

[DOI]

Discret. Math., 1993

How to Avoid the Cheaters Succeeding in the Key Sharing Scheme.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1993

Decoding a bit more than the BCH bound.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1993

1991

Completely Transitive Codes and Distance Transitive Graphs.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1991

Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1991

1990

Classification of a class of distance-regular graphs via completely regular codes.

[BibT_eX]

[DOI]

Ll. Huguet

Discret. Appl. Math., 1990

On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1990

1988

On Completely Regular Propelinear Codes.

[BibT_eX]

[DOI]

Josep M. Basart

Proceedings of the Applied Algebra, 1988

1987

On the Construction of Completely Regular Linear Codes from Distance-Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1987

Covering Radius for Codes Obtained from T(m) Triangular Graphs.

[BibT_eX]

[DOI]

Josep M. Basart

Proceedings of the Applied Algebra, 1987

1986

Characterization of Completely Regular Codes through P-Polynomial Association Schemes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1986

1985

Pseudo-Triple-Sum-Sets and Association Schemes.

[BibT_eX]

[DOI]

Mercè Griera

Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

On S-Sum-Sets and Projective Codes.

[BibT_eX]

[DOI]

Mercè Griera