Josep Rifà

According to our database1, Josep Rifà authored at least 88 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On completely regular and completely transitive supplementary codes.
Discret. Math., 2020

Rank and Kernel of F<sub>p</sub>-Additive Generalised Hadamard Codes.
CoRR, 2020

Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Erratum to: On Completely Regular Codes.
Probl. Inf. Transm., 2019

On Completely Regular Codes.
Probl. Inf. Transm., 2019

2018
Quasi-Hadamard Full Propelinear Codes.
Math. Comput. Sci., 2018

Hadamard full propelinear codes of type Q; rank and kernel.
Des. Codes Cryptogr., 2018

Completely regular codes by concatenating Hamming codes.
Adv. Math. Commun., 2018

2017
About non equivalent completely regular codes with identical intersection array.
Electron. Notes Discret. Math., 2017

Completely regular codes with different parameters giving the same distance-regular coset graphs.
Discret. Math., 2017

2016
Ranks and Kernels of Codes From Generalized Hadamard Matrices.
IEEE Trans. Inf. Theory, 2016

About some Hadamard full propelinear (2t, 2, 2)-codes. Rank and Kernel.
Electron. Notes Discret. Math., 2016

2015
Construction of Hadamard ℤ<sub>2</sub> ℤ<sub>4</sub> Q<sub>8</sub>-Codes for Each Allowable Value of the Rank and Dimension of the Kernel.
IEEE Trans. Inf. Theory, 2015

Self-embeddings of Hamming Steiner triple systems of small order and APN permutations.
Des. Codes Cryptogr., 2015

Erratum to: Intersection of Hamming codes avoiding Hamming subcodes.
Des. Codes Cryptogr., 2015

Families of nested completely regular codes and distance-regular graphs.
Adv. Math. Commun., 2015

2014
About a class of Hadamard propelinear codes.
Electron. Notes Discret. Math., 2014

On a family of binary completely transitive codes with growing covering radius.
Discret. Math., 2014

Families of completely transitive codes and distance transitive graphs.
Discret. Math., 2014

New families of completely regular codes and their corresponding distance regular coset graphs.
Des. Codes Cryptogr., 2014

Hadamard \(\mathbb{Z}_{2}\mathbb{Z}_{4}Q_{8}\)-Codes: Rank and Kernel.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013
Families of Hadamard BBZ<sub>2</sub>BBZ<sub>4</sub>Q<sub>8</sub>-Codes.
IEEE Trans. Inf. Theory, 2013

On the Number of Nonequivalent Propelinear Extended Perfect Codes.
Electron. J. Comb., 2013

Biembeddings of small order hamming STS(n) and APN monomial power permutations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Intersection of Hamming codes avoiding Hamming subcodes.
Des. Codes Cryptogr., 2012

On two families of binary quadratic bent functions
CoRR, 2012

Families of Hadamard Z2Z4Q8-codes
CoRR, 2012

Structural properties of binary propelinear codes.
Adv. Math. Commun., 2012

2011
On Lifting Perfect Codes.
IEEE Trans. Inf. Theory, 2011

ℤ<sub>2</sub>ℤ<sub>4</sub>-additive perfect codes in Steganography.
Adv. Math. Commun., 2011

Spectrum Sharing Models in Cognitive Radio Networks.
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.
IEEE Trans. Inf. Theory, 2010

<i>Z</i><sub>2</sub><i>Z</i><sub>4</sub>-linear codes: generator matrices and duality.
Des. Codes Cryptogr., 2010

Product Perfect Z2Z4-linear codes in Steganography
CoRR, 2010

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

Perfect Z2Z4-linear codes in Steganography
CoRR, 2010

On q-ary linear completely regular codes with ρ=2 and antipodal dual.
Adv. Math. Commun., 2010

Product perfect Z2 Z4-linear codes in steganography.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
On the Intersection of BBZ<sub>2</sub>BBZ<sub>4</sub>-Additive Hadamard Codes.
IEEE Trans. Inf. Theory, 2009

Construction of BBZ<sub>4</sub>-Linear Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2009

Product perfect codes and steganography.
Digit. Signal Process., 2009

On a class of binary linear completely transitive codes with arbitrary covering radius.
Discret. Math., 2009

Propelinear structure of Z_{2k}-linear codes
CoRR, 2009

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

Construction of Additive Reed-Muller Codes.
Proceedings of the Applied Algebra, 2009

2008
On the Intersection of Z<sub>2</sub>Z<sub>4</sub>-Additive Perfect Codes.
IEEE Trans. Inf. Theory, 2008

On non-antipodal binary completely regular codes.
Discret. Math., 2008

Construction of Z4-linear Reed-Muller codes
CoRR, 2008

On the Kronecker Product Construction of Completely Transitive q-Ary Codes.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007
On new completely regular <i>q</i>-ary codes.
Probl. Inf. Transm., 2007

Z2Z4-linear codes: generator matrices and duality
CoRR, 2007

Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes.
Proceedings of the Applied Algebra, 2007

2006
On the additive (/spl Zopf//sub 4/-linear and non-/spl Zopf//sub 4/-linear) Hadamard codes: rank and kernel.
IEEE Trans. Inf. Theory, 2006

On the intersection of additive perfect codes
CoRR, 2006

Hadamard Codes of Length 2<sup><i>t</i></sup><i>s</i> (<i>s</i> Odd). Rank and Kernel.
Proceedings of the Applied Algebra, 2006

2005
Rank and kernel of binary Hadamard codes.
IEEE Trans. Inf. Theory, 2005

Kernels and <i>p</i>-Kernels of <i>p</i><sup><i>r</i></sup>-ary 1-Perfect Codes.
Des. Codes Cryptogr., 2005

2003
On Z<sub>4</sub>-linear Preparata-like and Kerdock-like code.
IEEE Trans. Inf. Theory, 2003

The rank and kernel of extended 1-perfect Z<sub>4</sub>-linear and additive non-Z<sub>4</sub>-linear codes.
IEEE Trans. Inf. Theory, 2003

2002
On binary 1-perfect additive codes: Some structural properties.
IEEE Trans. Inf. Theory, 2002

2001
Nonexistence of completely transitive codes with error-correcting capability e>3.
IEEE Trans. Inf. Theory, 2001

Every Z<sub>2k</sub>-Code is a Binary Propelinear Code.
Electron. Notes Discret. Math., 2001

On completely regular binary codes and t-designs<sup>*</sup>.
Electron. Notes Discret. Math., 2001

1-Perfect Uniform and Distance Invariant Partitions.
Appl. Algebra Eng. Commun. Comput., 2001

2000
On the nonexistence of completely transitive codes.
IEEE Trans. Inf. Theory, 2000

Efficient construction of vote-tags to allow open objection to the tally in electronic elections.
Inf. Process. Lett., 2000

1999
A characterization of 1-perfect additive codes.
IEEE Trans. Inf. Theory, 1999

Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the <i>n</i>-cube.
SIAM J. Discret. Math., 1999

On the Characterization of Linear Uniquely Decodable Codes.
Des. Codes Cryptogr., 1999

1998
A New Algebraic Algorithm to Decode the Ternary Golay Code.
Inf. Process. Lett., 1998

1997
Translation-invariant propelinear codes.
IEEE Trans. Inf. Theory, 1997

Large scale elections by coordinating electoral colleges.
Proceedings of the Information Security in Research and Business, 1997

1996
An implementable secure voting scheme.
Comput. Secur., 1996

1995
Groups of complex integers used as QAM signals.
IEEE Trans. Inf. Theory, 1995

A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields.
Math. Syst. Theory, 1995

1993
A note about multidesigns and extended designs.
Discret. Math., 1993

How to Avoid the Cheaters Succeeding in the Key Sharing Scheme.
Des. Codes Cryptogr., 1993

Decoding a bit more than the BCH bound.
Proceedings of the Algebraic Coding, 1993

1991
Completely Transitive Codes and Distance Transitive Graphs.
Proceedings of the Applied Algebra, 1991

Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields.
Proceedings of the Applied Algebra, 1991

1990
Classification of a class of distance-regular graphs via completely regular codes.
Discret. Appl. Math., 1990

On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs.
Proceedings of the Applied Algebra, 1990

1988
On Completely Regular Propelinear Codes.
Proceedings of the Applied Algebra, 1988

1987
On the Construction of Completely Regular Linear Codes from Distance-Regular Graphs.
Proceedings of the Applied Algebra, 1987

Covering Radius for Codes Obtained from T(m) Triangular Graphs.
Proceedings of the Applied Algebra, 1987

1986
Characterization of Completely Regular Codes through P-Polynomial Association Schemes.
Proceedings of the Applied Algebra, 1986

1985
Pseudo-Triple-Sum-Sets and Association Schemes.
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

On S-Sum-Sets and Projective Codes.
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985


  Loading...