department of
Information and Communications Engineering


Activitat de Recerca de

  1. Pujol, J.; Rifà, J.; Ronquillo, L.. Construction of Additive Reed-Muller Codes. Lecture Notes in Computer Science ( June 2009 ) vol. 5527. , pp: 223-226. ISSN: 0302-9743 (Print) 1611-3349 (Online).
    Full ref.
  2. Rifà, J.; Slovieva, F.; Villanueva, M.. On the intersection of Z2Z4-additive Hadamard codes. IEEE Transactions on Information Theory ( April 2009 ) vol. 55. no. 4, pp: 1766-1774. ISSN: 0018-9448. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  3. Rifà, J.; Zinoviev, V.. On a class of binary linear completely transitive codes with arbitrary covering radius. Discrete Mathematics ( April 2009 ) no. 309, pp: 5011-5016. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  4. Borges, J.. Review in: Mathematical Review. MR2451027( 2009 ) Alderson, Tim L.; Mellinger, Keith E. Families of OOC with $lambda=2$. IEEE Trans. Inform. theory 54(2008), no. 8, 3722--3724.
    Full ref.More Information
  5. Borges, J.; Rifà, J.; Villanueva, M.. On some topics in Combinatorial Coding Theory. In Congreso de la Real Sociedad Matemática Española, Nuevos avances en Criptografía y codificación de la informaciónEdiciones y Publicaciones de la UdL vol. 1 , P. Abascal; J.M. Miret, D. Sadornil; J. Tena , pp: 3-13.RSME- ( Febrero 2009 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  6. Pujol, J.; Rifà, J.; Slovieva, F.. Construction of Z4-Linear Reed–Muller Codes. IEEE Transactions on Information Theory ( January 2009 ) vol. 55. no. 1, pp: 99--104. ISSN: 0018-9448. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  7. Pujol, J.. Review in: Mathematical Review. MR2411120 ( 2009 ) Some combinatorial constructions for optimal perfect deletion-correcting codes by Wang, Jianmin in Des. Codes Cryptogr. 48 (2008), no. 3, 331--347.
    Full ref.More Information
  8. Pujol, J.. Review in: Mathematical Review. 2009b:05271( 2009 ) Lattices associated with distance-regular graphs by Wang, Kaishun; Li, Zengti in European J. Combin. 29 (2008), no. 2, 379--385.
    Full ref.More Information
  9. Pujol, J.. Review in: Mathematical Review. 2009b:94077( 2009 ) On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics by Skriganov, M. M. in J. Complexity 23 (2007), no. 4-6, 926--936.
    Full ref.More Information
  10. Rifà, J.; Zinoviev, V.. Estada de professor visitant. ( 2009 )
    Reference: 2008PIV0050
    Applicability: From 1-3-2009 to 30-6-2009
    Full ref.
  11. Rifà, J.; Zinoviev, V.. On the Kronecker Product Construction of Completely Transitive q -Ary Codes . Lecture Notes in Computer Science ( August 2008 ) vol. 5228. , pp: 163-170. ISSN: 978-3-540-87447-8. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  12. Gaston, B.; Pujol, J.; Villanueva, M.. Development of algorithmic methods for binary non-linear codes in MAGMA. In VI Jornadas de Matemática Discreta y AlgorítmicaUniversitat de Lleida , Josep Conde, Joan Gimbert, Josep M. Miret, Ramiro Moreno, Magda Valls , pp: 345-351.( July 2008 ) ISBN: 978-84-8409-263-6. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  13. Pujol, J.; Rifà, J.; Slovieva, F.. On New Quaternary Reed-Muller Codes. In Proceedings 2008 IEEE Region 8 international conference on computational technologies in electrical and electronics engineering “SIBIRCON 2008”IEEE Press , pp: 16-19.( July 2008 ) ISBN: ISBN 978-1-4244-2133-6. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  14. Pujol, J.. Review in: Mathematical Review. 2008a:94191( 2008 ) On the stabilizers of the minimum-weight codewords of the binary codes from triangular graphs by Rodrigues, B. G. in Ars Combin. 82 (2007), 353--364.
    Full ref.More Information
  15. Rifà, J.; Ronquillo, L.. About the Z4-linear Reed-Muller ZRM^-(r,m-1) and RMs(r,m) codes. In VI Jornadas de Matemática Discreta y AlgorítmicaUniversitat de Lleida Lleida. vol. VI , Josep Conde, Joan Gimbert, Josep M. Miret, Ramiro Moreno, Magda Valls , pp: 517-526.( July 2008 )
    Full ref.
  16. Ronquillo, L.. On data-hiding and nonlinear codes. , Universitat Autònoma de Barcelona (ETSE)( juliol 2008 )
    Full ref.
  17. Rifà, J.; Slovieva, F.. Estada de professor visitant. ( 2008 )
    Reference: 2007PIV-0013
    Applicability: From 1-10-2008 to 28-2-2009
    Full ref.
  18. Pernas, J.; Pujol, J.; Villanueva, M.. Kernel dimension for some families of quaternary Reed-Muller codes. Lecture Notes in Computer Science ( December 2008 ) vol. 5393. , pp: 128-141. ISSN: 0302-9743 (Print) 1611-3349 (Online). DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  19. Rifà, J.; Slovieva, F.; Villanueva, M.. Quaternary Hadamard codes and their intersections. In 1st Istanbul design theory and combinatorics conference.  ( June 2008 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  20. Fernández, C.; Pujol, J.; Villanueva, M.. On Rank and Kernel of Z4-linear codes. Lecture Notes in Computer Science ( September 2008 ) vol. 5228. , pp: 46-55. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  21. Fernández, C.; Pujol, J.; Villanueva, M.. Z2Z4-linear codes: rank and kernel. Technical report arXiv:0807.4247( July 2008 )
    Full ref.Full text
  22. Borges, J.; Fernández, C.; Pujol, J.; Rifà, J.; Villanueva, M.. Red temática de Matemáticas en la Sociedad de la Información (MATSI). ( 2008 )
    Project chairman: J. M. Miret (UdL)
    Reference: MTM2008-03268-E /MTM
    Applicability: From 1-11-2008 to 31-10-2009
    Full ref.
  23. Rifà, J.; Pujol, J.; Herrera, J.. MyCity, interacción de las administraciones públicas con sus ciudadanos a través de las redes sociales. ( 2008 )
    Project chairman: J. Rifà
    Reference: TSI-020501-2008-191 (Ministerio de Indústria, Turismo y Comercio) (SCYTL Secure Electronic Voting, S.A.)
    Applicability: From 1-12-2008 to 31-3-2011
    Full ref.
  24. Rifà, J.; Pujol, J.; Villanueva, M.. Sistema de integridad de registro para tarjetas de crédito (PCI-DSS) y datos personales (LOPD). ( 2008 )
    Project chairman: J. Rifà
    Reference: TSI-020100-2008-540 (Ministerio de Indústria, Turismo y Comercio)
    Applicability: From 1-9-2008 to 31-3-2010
    Full ref.
  25. Borges, J.; Rifà, J.; Zinoviev, V.. On non-antipodal completely regular codes. Discrete Mathematics ( Agost 2008 ) vol. 308. no. 16, pp: 3508-3525. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  26. Borges, J.. Review in: Mathematical Reviews. MR2397206( 2008 ) S. Nishimura, T. Hiramatsu. A generalization of the Lee distance and error correcting codes. Discrete Applied Maths., 156 (2008), pp. 588-595.
    Full ref.More Information
  27. Fernández, C.; Pujol, J.; Villanueva, M.. Pairs of rank and kernel dimension for Z2Z4-linear codes. In 1st Istanbul design theory and combinatorics conference ( June 2008 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  28. Borges, J.. Review in: Mathematical Reviews. MR2354045( 2008 ) Heden, Olof. The partial order of perfect codes associated to a perfect code. Adv. Math. Commun. 1 (2007), no. 4, 399-412.
    Full ref.More Information
  29. Borges, J.; Fernández, C.; Phelps, K.. ZRM Codes. IEEE Transactions on Information Theory ( Gener 2008 ) vol. 54. no. 1, pp: 380-386. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  30. Rifà, J.; Slovieva, F.; Villanueva, M.. On the intersection of Z2Z4-additive perfect codes. IEEE Transactions on Information Theory ( March 2008 ) vol. 54. no. 3, pp: 1346-1356. ISSN: 0018-9448. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  31. Borges, J.. Review in: Mathematical Reviews. MR2292880( 2007 ) Dinh, Hai Q. Complete distances of all negacyclic codes of length $2^s$ over $Z_{2^a}$. IEEE Trans. Inform. theory 53 (2007), no. 1, 147--161.
    Full ref.More Information
  32. Huertas, M.; Pujol, J.. e-Learning de las Matemáticas en las Universidades Españolas: tendencias tecnológicas emergentes y adaptación al EEES. ( 2007 )
    Project chairman: M. Antonia Huertas
    Reference: EA2007-0310 (MEC: Estudios y análisis)
    Applicability: From 1-5-2007 to 30-4-2008
    Full ref.
  33. Cortés, A.; Senar, M.; César, E.; Toledo, R.; Verge, X.; Moure, J.; Suppi, R.; Pujol, J.; Morajko, A.; Hernández, .; Sorribes, J.. EPI: Ensenyament Presencial Interactiu. ( 2007 )
    Project chairman: Ana Cortés
    Reference: 2007MQD00135 (Generalitat de Catalunya)
    Applicability: From 1-7-2007 to 30-6-2009
    Full ref.
  34. Toledo, R.; Pujol, J.; Pons, J.; Verge, X.; Oriols, X.; Borges, J.; Cortés, A.; Franco, D.. Plataforma de “e-learning” para la definición de actividades de formación incluyendo la medición y cuantificación del esfuerzo de alumnos y profesores en asignaturas de la titulación de Ingeniería Técnica en Informática impartidas según ECTS. ( 2007 )
    Project chairman: Ricardo Toledo
    Reference: EA2007-0286 (Ministerio de Educación y Ciencia)
    Applicability: From 29-5-2007 to 30-4-2008
    Full ref.
  35. Pujol, J.. Review in: Mathematical Review. 2007h:05165( 2007 ) A note on strongly regular self-complementary graphs by Tian, Fang in Chinese Quart. J. Math. 21 (2006), no. 1, 62--65.
    Full ref.More Information
  36. Pujol, J.. Review in: Mathematical Review. 2007g:94085( 2007 ) Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration by Jain, Sapna; Nam, Ki-Bong in Linear Algebra Appl. 418 (2006), no. 1, 122--129.
    Full ref.More Information
  37. Pujol, J.. Review in: Mathematical Review. 2007f:94016( 2007 ) An information-lossless decomposition theory of relational information systems by Lee, Tony T.; Lo, Terry Y.; Wang, Jianfang in IEEE Trans. Inform. Theory 52 (2006), no. 5, 1890--1903.
    Full ref.More Information
  38. Borges, J.; Fernández, C.; Pujol, J.; Rifà, J.; Villanueva, M.. Códigos combinatorios óptimos. ( 2007 )
    Project chairman: M. Villanueva
    Reference: PCI2006-A7-0616
    Applicability: From 1-11-2007 to 31-7-2011
    Full ref.
  39. Pujol, J.; Rifà, J.; Slovieva, F.. Quaternary Plotkin constructions and quaternary Reed-Muller codes. Lecture Notes in Computer Science ( December 2007 ) vol. 4851. , pp: 148-157. ISSN: ISBN 978-3-540-77223-1. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  40. Borges, J.; Fernández, C.; Pujol, J.; Rifà, J.; Villanueva, M.. Z2Z4-linear codes: generator matrices and duality. Technical report arXiv:0710.1149( Octubre 2007 )
    Full ref.More Information
  41. Borges, J.; Fernández, C.. Plotkin construction: Rank and Kernel. Technical report arXiv:0707.3878v1( July 2007 )
    Full ref.More Information
  42. Borges, J.. Review in: Mathematical Reviews. MR2196859(2007f:94111)( 2007 ) An optimal lower bound for 2-query locally decodable linear codes by Shiowattana, Dungjade; Lokam, Satyanarayana V. in Information Processing Letters, 97(2006), no. 6, pp. 244-250.
    Full ref.More Information
  43. Borges, J.; Fernández, C.; Pujol, J.; Rifà, J.; Villanueva, M.. Matemáticas en la sociedad de la Información (MATSI). ( 2007 )
    Project chairman: J. M. Miret (UdL)
    Reference: MTM2006-28247-E
    Applicability: From 1-10-2007 to 30-9-2008
    Full ref.
  44. Rifà, J.; Zinoviev, V.. On new completely regular codes. Problems of Information Transmission ( 2007 ) vol. 43. no. 2, pp: 97-112. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  45. Fernández, C.; Villanueva, M.. Z2Z4-linear codes: rank and kernel. In XI International Symposium on problems of redundancy in information and control systems  St. Petersburg. , pp: 62-65.Russian Academy of Science- ( July 2007 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  46. Villanueva, M.; Slovieva, F.. Estancia Profesorado Visitante. ( 2007 )
    Reference: VIS2007-16
    Applicability: From 20-4-2007 to 19-5-2007
    Full ref.
  47. Rifà, J.; Slovieva, F.; Villanueva, M.. Intersection of quaternary linear Hadamard codes. In International Workshop on Hadamard and Cocyclic Matrices and Applications, IWHCMA'07,Universidad de Sevilla ( June 2007 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  48. Phelps, K.; Villanueva, M.. On the intersection problem for Hadamard codes. In International Workshop on Hadamard and Cocyclic Matrices and Applications. IWHCMA'07, Universidad de Sevilla ( June 2007 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  49. Rifà, J.; Slovieva, F.; Villanueva, M.. On the intersection of additive extended and non-extended perfect codes. In Proceedings of Workshop on Coding and Cryptography, WCC'07, INRIA. Roquencourt, France. , pp: 333-341.( April 16-20 2007 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  50. Phelps, K.; Villanueva, M.. Intersection of Hadamard codes. IEEE Transactions on Information Theory ( May 2007 ) vol. 53. no. 5, pp: 1924-1928. ISSN: 0018-9448. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  51. Pujol, J.. Review in: Mathematical Review. 2006m:94032( 2006 ) On constant composition codes by Chu, Wensong; Colbourn, Charles J.; Dukes, Peter in Discrete Appl. Math. 154 (2006), no. 6, 912--929.
    Full ref.More Information
  52. Pujol, J.. Review in: Mathematical Review. 2006k:05224( 2006 ) Association schemes of conjugate matrices by Szczerba-Zubek, Anna in J. Statist. Plann. Inference 136 (2006), no. 1, 270--281.
    Full ref.More Information
  53. Pujol, J.. Review in: Mathematical Review. 2006j:94040( 2006 ) Some results on a generalized useful information measure by Khan, Abul Basar; Bhat, Bilal Ahmad; Pirzada, S. in JIPAM. J. Inequal. Pure Appl. Math. 6 (2005), no. 4, Article 117, 5 pp. (electronic).
    Full ref.More Information
  54. Pujol, J.. Review in: Mathematical Review. 2006i:94109( 2006 ) Simplex codes over the ring $\sum\sb {n=0}\sp su\sp nF\sb 2$ by AL-Ashker, Mohammed M. in Turkish J. Math. 29 (2005), no. 3, 221--233.
    Full ref.More Information
  55. Pujol, J.. Review in: Mathematical Review. 2006a:05179( 2006 ) Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency by Jurišić, Aleksandar; Koolen, Jack; Miklavič, Štefko in J. Combin. Theory Ser. B 94 (2005), no. 2, 245--258.
    Full ref.More Information
  56. Borges, J.; Fernández, C.; Phelps, K.. On ZRM codes. In V Jornadas de Matemática Discreta y AlgorítmicaUniversidad de Valladolid , pp: 163-170.( 2006 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  57. Borges, J.; Fernández, C.; Pujol, J.; Rifà, J.; Villanueva, M.. Caracterización y construcción, a partir de criterios estructurales, de códigos combinatorios óptimos. ( 2006 )
    Project chairman: J.Rifà
    Reference: MTM2006-03250 (Ministerio de Educación y Ciencia (España))
    Applicability: From 1-10-2006 to 30-9-2009
    Full ref.
  58. Borges, J.; Fernández, C.; Pujol, J.; Villanueva, M.. Fingerprinting. Utilització de codis Z4-lineals Hadamard.. ( 2006 )
    Project chairman: J.Rifà
    Reference: PNL2006-13 (UAB)
    Applicability: From 1-1-2006 to 31-12-2006
    Full ref.
  59. Rifà, J.; Dejter, I.. Estancia Profesorado Visitante. ( 2006 )
    Reference: VIS21006-2008
    Applicability: From 2-10-2006 to 18-11-2006
    Full ref.
  60. Borges, J.; Rifà, J.; Zinoviev, V.. On non-antipodal binary completely regular codes. In ACCT-10Russian Academic of Sciences , IITP-RAS , pp: 35-40.( 2006 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  61. Rifà, J.; Zinoviev, V.. On completely regular codes from perfect codes. In ACCT-10Russian Academic of Sciences , IITP-RAS , pp: 225-230.( 2006 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  62. Rifà, J.; Zinoviev, V.. Construction of new completely regular q-ary codes from q-ary perfect codes. In V Jornadas de Matemática Discreta y AlgorítmicaUniversidad de Valladolid , pp: 407-414.( 2006 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  63. Borges, J.; Fernández, C.; Pujol, J.; Rifà, J.; Villanueva, M.. On Z2Z4-linear codes and duality. In V Jornadas de Matemática Discreta y AlgorítmicaUniversidad de Valladolid , pp: 171-178.( 2006 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  64. Phelps, K.; Rifà, J.; Villanueva, M.. Hadamard codes of length 2^t·s (s odd). Rank and Kernel. Lecture Notes in Computer Science ( February 2006 ) vol. 3857. , pp: 328-337. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  65. Rifà, J.; Slovieva, F.. Estancia Profesorado Visitante. ( 2006 )
    Reference: DCT2005-00525 and DCT2005-00289 (MCD)
    Applicability: From 1-3-2006 to 1-5-2006
    Full ref.
  66. Phelps, K.; Rifà, J.; Villanueva, M.. On the additive Z4-linear and non-Z4-linear Hadamard codes. Rank and Kernel. IEEE Transactions on Information Theory ( January 2006 ) vol. 52. no. 1, pp: 316-319. ISSN: 0018-9448. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  67. Pujol, J.. Review in: Mathematical Review. 2005k:05242)( 2005 ) A distance regular graph with intersection array (21, 16, 8; 1, 4, 14) does not exist by Coolsaet, K. in European J. Combin. 26 (2005), no. 5, 709--716.
    Full ref.More Information
  68. Pujol, J.. Review in: Mathematical Review. 2005g:94114( 2005 ) Graphs, tessellations, and perfect codes on flat tori by Costa, Sueli I. R.; Muniz, Marcelo; Agustini, Edson; Palazzo, Reginaldo in IEEE Trans. Inform. Theory 50 (2004), no. 10, 2363--2377.
    Full ref.More Information
  69. Pujol, J.. Review in: Mathematical Review. 2005g:20002( 2005 ) Perfect codes in ${\rm SL}(2,2\sp f)$ by Terada, Sachiyo in European J. Combin. 25 (2004), no. 7, 1077--1085.
    Full ref.More Information
  70. Pujol, J.. Review in: Mathematical Review. 2005f:68025( 2005 ) New upper and lower bounds on the channel capacity of read/write isolated memory by Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping; Sheng, Li in Discrete Appl. Math. 140 (2004), no. 1-3, 35--48.
    Full ref.More Information
  71. Fernández, C.. On Reed-Muller and related quaternary codes. Phdthesis, Universitat Autònoma de Barcelona, Barcelona. ( Octubre 2005 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  72. Phelps, K.; Rifà, J.; Villanueva, M.. Rank and Kernel of binary Hadamard codes. IEEE Transactions on Information Theory ( November 2005 ) vol. 51. no. 11, pp: 3931-3937. ISSN: 0018-9448. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  73. Borges, J.; Fernández, C.; Phelps, K.. Quaternary Reed-Muller Codes. IEEE Transactions on Information Theory ( Juliol 2005 ) vol. 51. no. 7, pp: 2686 - 2691 . DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  74. Borges, J.; Rifà, J.; Zinoviev, V.. On non-antipodal binary completely regular codes. In Proceedings of Optimal Codes and Related Topics. OC'05Bulgarian Academic of Sciences Pomporovo, Bulgaria. ( June 2005 ) ISBN: 954-8986-18-3. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  75. Phelps, K.; Rifà, J.; Villanueva, M.. Kernels and p-Kernels of p^r-ary 1-Perfect codes. Desings, Codes and Cryptography ( November 2005 ) vol. 37. no. 2, pp: 243-261. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  76. Phelps, K.; Rifà, J.; Villanueva, M.. Binary Hadamard Codes of length 2^n. Rank and Kernel. In Proceedings of Optimal Codes and Related Topics. OC'05Bulgarian Academic of Sciences Pamporovo, Bulgaria. , pp: 244-247.( June 2005 ) ISBN: 954-8986-18-3. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  77. Ericson, T.; Rifà, J.. Estancia profesor Visitante. ( 2005 )
    Project chairman: Josep Rifa
    Reference: UAB-CIRIT: VIS2005-40
    Applicability: From 1-5-2005 to 20-5-2005
    Full ref.
  78. Rifà, J.; Zinoviev, V.. Estancia profesor Visitante. ( 2005 )
    Project chairman: Josep Rifa
    Reference: AGAUR: 2004PIV1-3
    Applicability: From 1-1-2005 to 31-12-2005
    Full ref.
  79. Borges, J.; Fernández, C.; Phelps, K.. Quaternary Reed-Muller codes. In SIAM Conference on Discrete Mathematics Nashville, USA. ( June 2004 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  80. Phelps, K.; Rifà, J.. Profesor Visitante. ( 2004 )
    Project chairman: Josep Rifa
    Reference: UAB-CIRIT: VIS2004-29
    Applicability: From 25-10-2004 to 14-11-2004
    Full ref.
  81. Rifà, J.. Review in: Mathematical Review. MR2036446 (2004m:94107)( 2004 ) A decoding algorithm for general Z4-linear codes. by Cui, Jie in J. Syst. Sci. Complex. 17 (2004), no. 1, 16--22.
    Full ref.More Information
  82. Borges, J.; Fernández, C.; Phelps, K.. Reed-Muller and Quaternary Related Codes: Rank and Kernel. In IV Jornadas de Matemática Discreta y AlgorítmicaUniversidad Politécnica de Madrid ( setembre 2004 ) Universidad Politécnica de Madrid. ISBN: 84-86189-98-5. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  83. Phelps, K.; Rifà, J.; Villanueva, M.. Rank and kernel of additive (Z4-linear and non-Z4-linear) Hadamard codes. In Proceedings of Algebraic and Combinatorial Coding Theory. ACCT'04Bulgarian Academic of Sciences Kranevo, Bulgaria. , pp: 327-332.( June 2004 ) ISBN: 954-8986-14-0. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  84. Masià, R.; Pujol, J.; Rifà, J.; Villanueva, M.. Matemàtica Discreta. Fundació Universitat Oberta de Catalunya ( setembre 2003 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  85. Borges, J.; Phelps, K.; Rifà, J.; Zinoviev, V.. On $Z4-linear preparata-like and kerdock-like codes. IEEE Transactions on Information Theory ( November 2003 ) vol. 49. no. 11, pp: 2834-2843. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  86. Borges, J.; Phelps, K.; Rifà, J.. The Rank and Kernel of Extended 1-Perfect Z4-Linear and Additive Non-Z4-Linear Codes. IEEE Transactions on Information Theory ( August 2003 ) vol. 49. no. 8, pp: 2028-2034. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  87. Borges, J.; Phelps, K.; Pujol, J.; Rifà, J.; Villanueva, M.; Zinoviev, V.. The rank and kernel of several non-linear codes. In Proceedings of Congreso conjunto AMS-RSME. Sevilla. ( Junio 2003 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  88. Phelps, K.; Rifà, J.; Villanueva, M.. Kernels of q-ary 1-perfect codes. In Proceedings of Workshop on Coding and Cryptography, WCC'03, INRIA. Roquencourt, France. , D.Augot, P.Charpin, G.Kabatianski , pp: 375-382.( March 2003 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  89. Borges, J.; Phelps, K.; Rifà, J.. 1-Perfect additive codes. In Extended abstracts of Arithmétique et Combinatoire, Marsella, França. ( 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  90. Fernández, C.. Propelinear Codes. , Universitat Autònoma de Barcelona, Depatarment d'informàtica. ( Setembre 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  91. Borges, J.; Fernández, C.. Punctured extended 1-perfect Z_4-linear codes. Technical report PIRDI. no. -3/02. ETSE( Novembre 2002 )
    Full ref.More Information
  92. Phelps, K.; Villanueva, M.. On Perfect codes: rank and kernel . Desings, Codes and Cryptography ( December 2002 ) vol. 27. no. 3, pp: 183-194. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  93. Phelps, K.; Villanueva, M.. Ranks of q-ary 1-perfect codes. Desings, Codes and Cryptography ( October-November 2002 ) vol. 27. no. 1-2, pp: 139-144. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  94. Minguillón, J.; Pujol, J.. Árboles de decisión. In Terceras Jornadas de Matemáticas Discretas y AlgorímicaUniversidad de Sevilla , pp: 28--34.Universidad de Sevilla- ( Septiembre 2002 ) ISBN: 84-607-5270-4. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  95. Zinoviev, V.; Rifà, J.. Estancia de Profesorado Visitante. ( 2002 )
    Project chairman: Rifà, J.
    Reference: DGU: SAB2000-58 (Dirección General de Universidades. Madrid.)
    Applicability: From 1-3-2002 to 1-6-2002
    Full ref.
  96. Rifà, J.; Climent, J.. Professor Visitant a la Universitat d'Alacant. ( 2002 )
    Project chairman: Rifà, J.
    Reference: CTESIN/2002/22
    Applicability: From 28-10-2002 to 28-11-2002
    Full ref.
  97. Borges, J.; Fernández, C.; Rifà, J.. Every $Z_{2k}$-Code accepts a representation as a Binary Propelinear Code. In Hypercube'2002Academic Press San Juan de Puerto Rico. Universidad de Puerto Rico, U.S.A.- ( 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  98. Rifà, J.. Binary $1$-error correcting Propelinear Codes. In Hypercube'2002 San Juan de P.R.. Universidad de Puerto Rico. U.S.A.- ( March 2002 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  99. Rifà, J.. Sobre las particiones del espacio de Hamming $F^n$ en códigos perfectos. In RSME'2002 Real Sociedad Matematica Española- ( Enero 2002 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  100. Borges, J.; Phelps, K.; Rifà, J.. On the rank and kernel of $Z_4$-linear Preparata-like codes. In ACCT-VIIIRussian Academic of Sciences St. Petersburg. Institute for Information Transmission Problems of Russian Academy of Sciences.- ( September 2002 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  101. Phelps, K.; Rifà, J.; Villanueva, M.. The Switching construction and kernels of q-ary 1-perfect codes. In ACCT-VIII  St. Petersburg. Institute for Information Transmission Problems of Russian Academy of Sciences.- ( September 2002 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  102. Borges, J.; Phelps, K.; Rifà, J.. Extended $1$-perfect additive codes. Technical report PIRDI. no. 1/2002. Dep. Informàtica U.A.B.( 2002 )
    Full ref.Full text
  103. Rifà, J.; Phelps, K.. On binary $1$-perfect additive codes: some structural properties. IEEE Transactions on Information Theory ( September 2002 ) vol. 48. no. 9, pp: 2587-2592. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  104. Guitart, P.. On the Performance of Zelikovsky's 11/6 Approximation Algorithm for the Steiner Problem in Graphs. In International Workshop on Interconnection Networks (IWIN 2001) , F. Comellas and P. Fraigniaud ( June 2001 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  105. Villanueva, M.. On Rank and kernel of perfect codes. Phdthesis, Departament d'Informàtica, Universitat Autònoma de Barcelona. ( Octubre 2001 ) ISBN: 84-699-8036-X. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  106. Guitart, P.. A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the the Steiner Problem in Graphs. In COMB'01Elsevier Science Publisher B.V. vol. 10 , Jaroslav Nesetril, Marc Noy and Oriol Serra ( 2001 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  107. Phelps, K.; Rifà, J.. Combinatorial Structure of Binary 1-Perfect Codes.. Technical report no. 488. Centre de Recerca Matematica( Desembre 2001 )
    Full ref.Full text
  108. Phelps, K.; Villanueva, M.. Bounds on the Rank and Kernel of Perfect Codes. In COMB '01 , CRM (Centre de Recerca Matemàtica) ( September 2001 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  109. Borges, J.; Rifà, J.; Zinoviev, V.. Nonexistence of completely transitive codes with error-correcting capability $e > 3$. IEEE Transactions on Information Theory ( May 2001 ) vol. 47. no. 4, pp: 1619-1621. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  110. Borges, J.; Fernández, C.; Rifà, J.. Every $Z_{2k}$-Code is a Binary Propelinear Code. In COMB'01Electronic Notes in Discrete Mthematics vol. 10 , Elsevier Science , pp: 100-102.( November 2001 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  111. Borges, J.; Rifà, J.; Zinoviev, V.. On completely regular binary codes and t-designs. In COMB'01Electronic Notes in Discrete Mthematics vol. 10 , Elsevier Science ( November 2001 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  112. Rifà, J.; Pujol, J.; Borges, J.. 1-Perfect Uniform and Distance Invariant Partitions. Nom revista absent ( Març 2001 ) vol. 11. , pp: 297-311. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  113. Borges, J.. Review in: Mathematical Reviews. 2000m:94035( 2000 ) Binary codes of strongly regular graphs by W.H. Haemers, R. Peeters and J.M. van Rijckevorsel in Des. Codes Cryptogr., 17 (1999), no. 1-3, 187-209
    Full ref.More Information
  114. Phelps, K.; Villanueva, M.. Rank and Kernel of 1-perfect codes. In II Jornades de Matemàtica Discreta i algorísmica Servei de Publicacions, UAB Ciutat de Palma (Mallorca). , pp: 89-91.( September 2000 ) ISBN: B-37997-2000. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  115. Rifà, J.; Villanueva, M.. Euclidean complex quadratic fields used for coding QAM signals. International Journal of Applied Mathematics ( 2000 ) vol. 2. no. 10, pp: 1181-1196. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  116. Serra, J.. Lattice Points Enumeration using the L1 norm. Phdthesis, Departament d'Informàtica, Universitat Autònoma de Barcelona. ( 2000 ) ISBN: 84-490-1815-3. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  117. Borges, J.; Rifà, J.. On the nonexistence of completely transitive codes. IEEE Transactions on Information Theory ( Gener 2000 ) vol. 46. no. 1, pp: 279-280. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  118. Pujol, J.. Review in: Mathematical Review . 99j:94029( 1999 ) Generating functions of circular codes by Frédérique Bassino in Advances in Applied Mathematics, 22 (1999)
    Full ref.More Information
  119. Pujol, J.. Review in: Mathematical Review. 99j:94023( 1999 ) Iterating an a-ary Gray code by Jonathan Lichtner in SIAM Journal on Discrete Mathematics, 11 (1998)
    Full ref.More Information
  120. Puiggené, A.. Codificació Turbo. , Universitat Autònoma de Barcelona, Departament d'Informàtica. ( 1999 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  121. Guitart, P.. Mètodes heurístics per al problema d'Steiner en grafs. Phdthesis, Universitat Autònoma de Barcelona, Departament d'Informàtica. ( 1999 ) ISBN: 84-490-1806-4. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  122. Borges, J.; Rifà, J.. A Characterization of 1-perfect Additive Codes. IEEE Transactions on Information Theory ( July 1999 ) vol. 45. no. 5, pp: 1688-1697. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  123. Cohen, G.; Rifà, J.; Tena, J.; Zemor, G.. On the characterization of linear uniquely decodable codes. Desings, Codes and Cryptography ( 1999 ) vol. 17. , pp: 87-96. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  124. Rifà, J.. Review in: Mathematical Review . 99f:94018( 1999 ) Perfect codes on the Towers of Hanoi graph by Chi-Kwong Li and Ingrid Nelson in Bull. Austral. Math. Soc, 57 (1998), no. 3, 367-376
    Full ref.More Information
  125. Rifà, J.. Well-Ordered Steiner Tryple Systems and 1-Perfect Partitions of the n-Cube. SIAM Journal on Discrete Mathematics ( 1999 ) vol. 12. no. 1, pp: 35--47. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  126. Serra, J.. Counting lattice points. In Métodos CombinatóriosProjecto Práxis Porto, Portugal. vol. I ( July 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  127. Rifà, J.. A new algorithm to decode the ternary Golay code. Information Processing Letters ( 1998 ) vol. 68/6. , pp: 271--274. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  128. Cohen, G.; Rifà, J.; Tena, J.; Zemor, G.. On the characterization of linear uniquely decodable codes. In Proceedings of the Algebraic and Combinatorial Coding Theory Workshop, ACCT-Y1 Pskov, Russia. , pp: 73--78.( September 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  129. Rifà, J.. Teoria de la Codificació. Problemes. Servei de Publicacions, UAB Barcelona. ( 1998 )vol. 50 ISBN: 84-490-1382-8. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  130. Borges, J.. Codis perfectes, particions i generalitzacions. Phdthesis, Universitat Autònoma de Barcelona( 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  131. Pujol, J.. Review in: Mathematical Review . 98e:94029( 1998 ) On binary linear codes which satisfy the two-chain condition by Sylvia B. Encheva in IEEE Transaction on Information Theory, 42-3 (1996) 1038-1047
    Full ref.More Information
  132. Rifà, J.; Villanueva, M.. Error-Correcting Codes for QAM from Integer Rings of an Euclidean Complex Quadratic Field. In Proceedings of the 1998 IEEE International symposium on Information TheoryIEEE Computer Society Press MIT, Cambridge, USA. ( August 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  133. Rifà, J.; Borges, J.; Pujol, J.. 1-Perfect Partitions and 1-Perfect Propelinear Codes. In Proceedings of VII International Colloquium on Numerical Analysis and Computer Science with Applications Plovdiv, Bulgaria. ( August 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  134. Rifà, J.; Villanueva, M.. Error-Correcting Codes for QAM from Rings of Integers of an Algebraic Number Field. In I Jornades de Matemàtica Discreta i AlgorísmicaServei de Publicacions, UPC , pp: 84-86.( Mars 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  135. Borges, J.; Pujol, J.; Rifà, J.. 1-Perfect Partitions and 1-Perfect Codes. In I Jornades de Matemàtica Discreta i AlgorísmicaServei de Publicacions, UPC , pp: 12--13.( Mars 1998 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  136. Rifà, J.; Villanueva, M.. Error-Correcting Codes for QAM from Rings of Integers of a Complex Algebraic Number Field. Technical report no. PIRDI-4/98. UAB( 1998 )
    Full ref.More Information
  137. Borges, J.; Rifà, J.. A characterization of 1-perfect additive codes. Technical report no. PIRDI-1/98. UAB( 1998 )
    Full ref.More Information
  138. Dejter, I.; Rifà, J.. Estancia de Profesorado Visitante. ( 1997 )
    Project chairman: Rifà, J.
    Reference: UAB-CIRIT. 1997
    Applicability: From 1-3-1997 to 1-4-1997
    Full ref.
  139. Rifà, J.. Estancias de profesorado visitante (Dr. Italo Dejter Glasman). ( 1997 )
    Project chairman: Josep Rifà
    Reference: Convocatoria UAB
    Applicability: From 1-2-1997 to 28-2-1997
    Full ref.
  140. Pujol, J.. Codis Propelineals invariants per translacions: classificació, construccions i particions associades. Phdthesis, Universitat Autònoma de Barcelona, Departament d'Informàtica. ( October 1997 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  141. Rifà, J.; Vardi, A.. On Partions of Space into Perfect Codes. In Proceedings of the III-Mediterranean Workshop on Coding Theory and Information Integrity Ein-Boqeq, Israel. ( October 1997 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  142. Pujol, J.; Rifà, J.. Additive Reed-Muller codes. In Proc. of IEEE International Symposium on Information Theory, ISIT'97 Ulm, Germany. , pp: 508.( June 1997 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  143. Rifà, J.; Pujol, J.. Translation Invariant Propelinear Codes. IEEE Transactions on Information Theory ( March 1997 ) vol. 43. no. 2, pp: 590--598. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  144. Cohen, G.; Rifà, J.; Zemor, G.. Uniquely Decodable Codes. In Proceedings of the 1997 IEEE International Workshop on Information TheoryIEEE Computer Society Press Svalbord, Norway. ( July 1997 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  145. Basart , J.; Rifà, J.; Villanueva, M.. Fonaments de Matemàtica Discreta. Elements de combinatòria i aritmètica. Servei de Publicacions, UAB Barcelona. ( 1997 )vol. 36 ISBN: 84-490-0855-7. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  146. Pujol, J.; Rifà, J.. Additive Reed-Muller Codes. In Proc. II Mediterranean Workshop on Coding and Information IntegrityUniversitat de les Illes Balears Palma de Mallorca. , pp: 104.( 1996 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  147. Villanueva, M.. Simulacions de codis correctors d'errors per QAM en canals Gaussians amb soroll blanc additiu. , Universitat Autònoma de Barcelona( Setembre 1996 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  148. Borges, J.; Dejter, I.. On Perfect Dominating Sets in Hypercubes and their Complements. The Journal of Combinatorial Mathematics and Combinatorial Computing ( 1996 ) no. 20, pp: 161--173. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  149. Serra, J.; Ortuño, I.. A neural network for soft-decision decoding of Reed-Solomon Codes. In Proceedings of WIRN95. 7th Italian workshop on Neural NetworksSpringer Verlag ( 1995 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  150. Dejter, I.; Pujol, J.. Perfect domination and symmetry in hypercubes. Congresus Numerantium ( 1995 ) vol. 111. , pp: 18--32. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  151. Rifà, J.. The Rational Approximations and the Decoding of One Error beyond the BCH Bound. In Proceedings of the II Israeli-French Workshop on Coding and Information Integrity Tel-Aviv University, Israel. vol. 45 ( March 1995 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  152. Rifà, J.. Gaussian Rings and the Differentially Coherent Detection of QAM Signals. In Proceedings of the International Conference on Telecommunications ICT'95 Bali, Indonesia. ( April 1995 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  153. Rifà, J.. Groups of Complex Integers Used as QAM Signals. IEEE Transactions on Information Theory ( September 1995 ) vol. 41. no. 5, pp: 1512--1517. DOI: 10.1109/TIT.2011.2119465.
    Full ref.Full text
  154. Rifà, J.; Borrell, J.. A Fast Algorithm to Compute Irreducible and Primitive Polynomials in Finite Fields. MST, Mathematical Systems Theory ( 1995 ) vol. 28. , pp: 13--20. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  155. Borges, J.; Rifà, J.. Multidiseños como diseños con repetición. SCIENTIA: An International Scientific Journal Official of the UTFSM ( June 1995 ) vol. 5. , pp: 1--12. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  156. Dejter, I.; Rifà, J.. Estancia Profesor Visitante. ( 1994 )
    Project chairman: Josep Rifa
    Reference: Convocatoria UAB
    Applicability: From 1-3-1994 to 1-6-1994
    Full ref.
  157. Serra, J.. Xarxes neuronals com a eina de descodificació en codis de Reed-Solomon. , Universitat Autònoma de Barcelona( 1994 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  158. Rifà, J.. Decoding a bit more than the BCH bound. Lecture Notes in Computer Science ( 1994 ) no. 781, pp: 287--304. ISSN: 3-540-54522-0. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  159. Dejter, I.. Estancia profesor Visitante. ( 1993 )
    Project chairman: Josep Rifa
    Reference: DGICYT: SAB93-0179
    Applicability: From 1-3-1993 to 1-8-2003
    Full ref.
  160. Rifà, J.. Estancias de profesorado visitante (Dr. Italo Dejter Glasman). ( 1993 )
    Project chairman: Josep Rifà
    Reference: Convocatoria UAB and DGICYT:SAB93-0179
    Applicability: From 1-1-1993 to 31-5-1993
    Full ref.
  161. Ortuño, I.; Ortuño, M.; Delgado, J.. Neural Networks for Block Decoding in the presence of channel symbols interferences. In Proceedings of the International Conference on Digital Signal Procesing and II International Conference on Computer Applications to Engineering Systems Nicosia, Chipre. vol. I , pp: 130--134.( 1993 ) ISBN: 9963-607-4. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  162. Borges, J.; Rifà, J.. On Perfect Dominating Sets in n-cubes. In Proceedings of the II International Workshop on Combinatorics, Coding and Graphs, Codigraf'93 La Platja d'Aro, España. ( Stember 1993 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  163. Rifà, J.; Pujol, J.. Completely Regular Codes Related to Distance Regular Graphs. In Proceedings of the II International Workshop on Combinatorics, Coding and Graphs, Codigraf'93Servei de Publicacions, UAB La Platja d'Aro, España. ( Setember 1993 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  164. Rifà, J.; Dejter, I.. About Additive Codes associated to Distance Regular Graph. In Proceedings of the II International Workshop on Combinatorics, Coding and Graphs, Codigraf'93 La Platja d'Aro, España. ( Setember 1993 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  165. Rifà, J.; Pujol, J.. Sobre l'estructura propelineal dels codis de Preparata. Technical report no. 11/92. Universitat Autònoma de Barcelona( 1992 )
    Full ref.More Information
  166. Rifà, J.. Error Correcting Codes: Theory and Applications. Prentice Hall ( 1992 )Chapters 7 DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  167. Rifà, J.. All s-Sum-Sets of type 2 or 3 are triple sum-sets. Computers & Mathematics with Applications ( 1992 ) vol. 23. no. 1, pp: 35--43. ISSN: 0097-4943/92. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  168. Pujol, J.. Relacions entre codis binaris completament regulars no lineals i grafs distància-regulars. , Universitat Autònoma de Barcelona, Departament d'Informàtica. ( 1991 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  169. Rifà, J.; Borrell, J.. Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields. In Proc. 10th International Conference, AAECC-10Springer Verlag vol. 539 , pp: 352--359.( 1991 ) ISBN: 3-540-54522-0. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  170. Rifà, J.; Pujol, J.. Completely Transitive Codes and Distance Transitive Graphs. In Proc. 9th International Conference, AAECC-9Springer Verlag vol. 539 , pp: 360--367.( 1991 ) ISBN: 3-540-54522-0. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  171. Rifà, J.. On a Categorial Isomorphism between a class of Completely Regular Codes and a class of Distance Regular Graphs. Lecture Notes in Computer Science ( 1991 ) no. 508, pp: 164--179. ISSN: 3-540-541195-0. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  172. Rifà, J.; Huguet, L.. Classification of a class of Distance Regular Graphs via Completely Regular Codes. Discrete Applied Mathematics ( March 1990 ) vol. 26. no. 2-3, pp: 289--300. ISSN: 0166-218X. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  173. Dalmau, J.; Delgado, J.; Huguet, L.; Ortuño, I.; Valle, R.. Concatenated coding schemes for H.F. channels. Lecture Notes in Computer Science ( 1989 ) vol. 388. , pp: 269--278. ISSN: 3-540-51643-0. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  174. Rifà, J.. Codes correcteurs: Théorie et applications. Masson Paris. ( 1989 )Chapters 7ISBN: 2-225-81595-X. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  175. Rifà, J.; Basart , J.; Huguet, L.. On Completely Regular Propelinear Codes. In Lecture Notes in Computer ScienceSpringer Verlag vol. 357 , pp: 341--355.( 1989 ) ISBN: 3-540-51083-4. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  176. Basart , J.; Rifà, J.. Covering Radius for Codes obtained from T(m) Triangular Graphs. In Lecture Notes in Computer ScienceSpringer Verlag vol. 356 , pp: 16--24.( 1989 ) ISBN: 3-540-51082-6. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  177. Rifà, J.. On the construction of Linear Completely Regular Codes from Distance Regular Graphs. Lecture Notes in Computer Science ( 1989 ) no. 356, pp: 376-393. ISSN: 3-540-51082-6. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  178. Dalmau, J.; Delgado, J.; Huguet, L.; Ortuño, I.; Valle, R.. Simulations of coding schemes used in H.F. digital mobile radio. In Proceeding of the Mini and Microcomputers and their applications , pp: 590--592.( 1988 ) ISBN: 84-7488-121-B. DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  179. Basart , J.; Huguet, L.. From T(m) Triangular Graphs to Single-Error-Correcting Codes. In Lecture Notes in Computer ScienceSpringer Verlag vol. 307 , pp: 5--12.( 1988 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  180. Rifà, J.; Huguet, L.. Characterization of Completely Regular Codes through P-Polynomial Association Schemes. Lecture Notes in Computer Science ( 1988 ) vol. 307. , pp: 157--167. ISSN: 3-540-19200-X. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  181. Rifà, J.. Equivalències entre estructures combinatòricament regulars: Codis, Esquemes i grafs. Phdthesis, Universitat Autònoma de Barcelona, Departament d'Informàtica. ( 1987 ) ISBN: 84-7488-199-4. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  182. Basart , J.. Construcció de codis correctors a partir de configuracions i grafs. Qüestió ( 1986 ) vol. 10. no. 2, pp: 93--97. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  183. Griera, M.; Rifà, J.; Huguet, L.. On S-Sum Sets and Projective Codes. Lecture Notes in Computer Science ( 1986 ) vol. 229. , pp: 135--142. ISSN: 3-540-16776-5. DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information
  184. Basart , J.; Huguet, L.. Utilización de códigos de Preparata en la codificación por trasladados. In Actes del VI Congrés de la Asociación Española de Informàtica y Automàtica Madrid. , pp: 505--509.( 1985 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.
  185. Basart , J.. Configuracions i Grafs en la Teoria de Codis. , Universitat Autònoma de Barcelona( 1985 ) DOI: 10.1109/TIT.2011.2119465.
    Full ref.More Information

Full BibTeX ref.