| 2009 |
|---|
| 45 | EE | Jaume Pujol,
Josep Rifà,
Faina I. Solov'eva:
Construction of BBZ4-Linear Reed-Muller Codes.
IEEE Transactions on Information Theory 55(1): 99-104 (2009) |
| 44 | EE | Josep Rifà,
Faina I. Solov'eva,
Mercè Villanueva:
On the Intersection of BBZ2BBZ4-Additive Hadamard Codes.
IEEE Transactions on Information Theory 55(4): 1766-1774 (2009) |
| 2008 |
|---|
| 43 | EE | Josep Rifà,
Victor Zinoviev:
On the Kronecker Product Construction of Completely Transitive q-Ary Codes.
ICMCTA 2008: 163-170 |
| 42 | EE | Jaume Pujol,
Josep Rifà,
Faina I. Solov'eva:
Construction of Z4-linear Reed-Muller codes
CoRR abs/0801.3024: (2008) |
| 41 | EE | Josep Rifà,
Victor A. Zinoviev:
New completely regular q-ary codes based on Kronecker products
CoRR abs/0810.4993: (2008) |
| 40 | EE | Joaquim Borges,
Josep Rifà,
Victor A. Zinoviev:
On non-antipodal binary completely regular codes.
Discrete Mathematics 308(16): 3508-3525 (2008) |
| 39 | EE | Josep Rifà,
Faina I. Solov'eva,
Mercè Villanueva:
On the Intersection of Z2Z4-Additive Perfect Codes.
IEEE Transactions on Information Theory 54(3): 1346-1356 (2008) |
| 2007 |
|---|
| 38 | EE | Jaume Pujol,
Josep Rifà,
Faina I. Solov'eva:
Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes.
AAECC 2007: 148-157 |
| 37 | EE | Joaquim Borges,
Cristina Fernandez,
Jaume Pujol,
Josep Rifà,
Mercè Villanueva:
Z2Z4-linear codes: generator matrices and duality
CoRR abs/0710.1149: (2007) |
| 2006 |
|---|
| 36 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
Hadamard Codes of Length 2ts (s Odd). Rank and Kernel.
AAECC 2006: 328-337 |
| 35 | EE | Josep Rifà,
Faina I. Solov'eva,
Mercè Villanueva:
On the intersection of additive perfect codes
CoRR abs/cs/0612015: (2006) |
| 34 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
On the additive (/spl Zopf//sub 4/-linear and non-/spl Zopf//sub 4/-linear) Hadamard codes: rank and kernel.
IEEE Transactions on Information Theory 52(1): 316-319 (2006) |
| 2005 |
|---|
| 33 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
Kernels and p-Kernels of pr-ary 1-Perfect Codes.
Des. Codes Cryptography 37(2): 243-261 (2005) |
| 32 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
Rank and kernel of binary Hadamard codes.
IEEE Transactions on Information Theory 51(11): 3931-3937 (2005) |
| 2003 |
|---|
| 31 | | Joaquim Borges,
Kevin T. Phelps,
Josep Rifà,
Victor A. Zinoviev:
On Z4-linear Preparata-like and Kerdock-like code.
IEEE Transactions on Information Theory 49(11): 2834-2843 (2003) |
| 30 | | Joaquim Borges,
Kevin T. Phelps,
Josep Rifà:
The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes.
IEEE Transactions on Information Theory 49(8): 2028-2034 (2003) |
| 2002 |
|---|
| 29 | | Kevin T. Phelps,
Josep Rifà:
On binary 1-perfect additive codes: Some structural properties.
IEEE Transactions on Information Theory 48(9): 2587-2592 (2002) |
| 2001 |
|---|
| 28 | EE | Josep Rifà,
Jaume Pujol,
Joaquim Borges:
1-Perfect Uniform and Distance Invariant Partitions.
Appl. Algebra Eng. Commun. Comput. 11(4): 297-311 (2001) |
| 27 | EE | Cristina Fernández-Córdoba,
Josep Rifà,
Joaquim Borges:
Every Z2k-Code is a Binary Propelinear Code.
Electronic Notes in Discrete Mathematics 10: 100-102 (2001) |
| 26 | EE | Joaquim Borges,
Josep Rifà,
Victor A. Zinoviev:
On completely regular binary codes and t-designs*.
Electronic Notes in Discrete Mathematics 10: 30-33 (2001) |
| 25 | | Joaquim Borges,
Josep Rifà,
Victor Zinoviev:
Nonexistence of completely transitive codes with error-correcting capability e>3.
IEEE Transactions on Information Theory 47(4): 1619-1621 (2001) |
| 2000 |
|---|
| 24 | | Joaquim Borges,
Josep Rifà:
On the nonexistence of completely transitive codes.
IEEE Transactions on Information Theory 46(1): 279-280 (2000) |
| 23 | EE | Andreu Riera,
Josep Rifà,
Joan Borrell:
Efficient construction of vote-tags to allow open objection to the tally in electronic elections.
Inf. Process. Lett. 75(5): 211-215 (2000) |
| 1999 |
|---|
| 22 | | Gérard D. Cohen,
Josep Rifà,
J. Tena,
Gilles Zémor:
On the Characterization of Linear Uniquely Decodable Codes.
Des. Codes Cryptography 17(1-3): 87-96 (1999) |
| 21 | | Joaquim Borges,
Josep Rifà:
A characterization of 1-perfect additive codes.
IEEE Transactions on Information Theory 45(5): 1688-1697 (1999) |
| 20 | EE | Josep Rifà:
Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube.
SIAM J. Discrete Math. 12(1): 35-47 (1999) |
| 1998 |
|---|
| 19 | EE | Josep Rifà:
A New Algebraic Algorithm to Decode the Ternary Golay Code.
Inf. Process. Lett. 68(6): 271-274 (1998) |
| 1997 |
|---|
| 18 | | Andreu Riera,
Joan Borrell,
Josep Rifà:
Large scale elections by coordinating electoral colleges.
SEC 1997: 349-362 |
| 17 | | Josep Rifà,
Jaume Pujol:
Translation-invariant propelinear codes.
IEEE Transactions on Information Theory 43(2): 590-598 (1997) |
| 1996 |
|---|
| 16 | EE | Joan Borrell,
Josep Rifà:
An implementable secure voting scheme.
Computers & Security 15(4): 327-338 (1996) |
| 1995 |
|---|
| 15 | | Josep Rifà:
Groups of complex integers used as QAM signals.
IEEE Transactions on Information Theory 41(5): 1512-1517 (1995) |
| 14 | | Josep Rifà,
Joan Borrell:
A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields.
Mathematical Systems Theory 28(1): 13-20 (1995) |
| 1993 |
|---|
| 13 | | Josep Rifà-Coma:
Decoding a bit more than the BCH bound.
Algebraic Coding 1993: 287-303 |
| 12 | | Josep Rifà-Coma:
How to Avoid the Cheaters Succeeding in the Key Sharing Scheme.
Des. Codes Cryptography 3(3): 221-228 (1993) |
| 11 | EE | Joaquim Borges,
Josep Rifà:
A note about multidesigns and extended designs.
Discrete Mathematics 111(1-3): 65-69 (1993) |
| 1991 |
|---|
| 10 | | Josep Rifà,
Joan Borrell:
Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields.
AAECC 1991: 352-359 |
| 9 | | Josep Rifà,
Jaume Pujol:
Completely Transitive Codes and Distance Transitive Graphs.
AAECC 1991: 360-367 |
| 1990 |
|---|
| 8 | | Josep Rifà-Coma:
On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs.
AAECC 1990: 164-179 |
| 7 | EE | Josep Rifà,
Ll. Huguet:
Classification of a class of distance-regular graphs via completely regular codes.
Discrete Applied Mathematics 26(2-3): 289-300 (1990) |
| 1988 |
|---|
| 6 | | Josep Rifà,
Josep M. Basart,
Llorenç Huguet i Rotger:
On Completely Regular Propelinear Codes.
AAECC 1988: 341-355 |
| 1987 |
|---|
| 5 | | Josep M. Basart,
Josep Rifà:
Covering Radius for Codes Obtained from T(m) Triangular Graphs.
AAECC 1987: 16-24 |
| 4 | | Josep Rifà-Coma:
On the Construction of Completely Regular Linear Codes from Distance-Regular Graphs.
AAECC 1987: 376-393 |
| 1986 |
|---|
| 3 | | Josep Rifà,
Llorenç Huguet i Rotger:
Characterization of Completely Regular Codes through P-Polynomial Association Schemes.
AAECC 1986: 157-167 |
| 1985 |
|---|
| 2 | | Mercè Griera,
Josep Rifà,
Llorenç Huguet i Rotger:
On S-Sum-Sets and Projective Codes.
AAECC 1985: 135-142 |
| 1 | | Llorenç Huguet i Rotger,
Josep Rifà,
Mercè Griera:
Pseudo-Triple-Sum-Sets and Association Schemes.
AAECC 1985: 143-149 |
