default search action
Josep Rifà
Josep Rifà-Coma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j61]Joaquim Borges
, Josep Rifà
On new infinite families of completely regular and completely transitive codes. Discret. Math. 347(4): 113840 (2024) - 2023
- [i18]Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
On new infinite families of completely regular and completely transitive codes. CoRR abs/2303.11190 (2023) - 2022
- [b1]Joaquim Borges, Cristina Fernández-Córdoba, Jaume Pujol, Josep Rifà, Mercè Villanueva:
Z2Z4-Linear Codes. Springer 2022, ISBN 978-3-031-05440-2, pp. 1-245 - [j60]Ehsan Yavari
Locally Repairable Codes Based on Permutation Cubes and Latin Squares. IEEE Access 10: 9686-9702 (2022) - 2021
- [j59]Iván Bailera, Joaquim Borges
On Hadamard full propelinear codes with associated group C2t˟ C2. Adv. Math. Commun. 15(1): 35-54 (2021) - [j58]Steven T. Dougherty, Josep Rifà
Rank and Kernel of Additive Generalized Hadamard Codes. IEEE Trans. Inf. Theory 67(11): 7210-7220 (2021) - 2020
- [j57]Joaquim Borges
On completely regular and completely transitive supplementary codes. Discret. Math. 343(3): 111732 (2020) - [c20]Steven T. Dougherty, Josep Rifà, Mercè Villanueva
Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes. ISIT 2020: 150-155 - [i17]Steven T. Dougherty, Josep Rifà, Mercè Villanueva:
Rank and Kernel of Fp-Additive Generalised Hadamard Codes. CoRR abs/2001.11609 (2020)
2010 – 2019
- 2019
- [j56]Joaquim Borges
On Completely Regular Codes. Probl. Inf. Transm. 55(1): 1-45 (2019) - [j55]Joaquim Borges
Erratum to: On Completely Regular Codes. Probl. Inf. Transm. 55(3): 298 (2019) - 2018
- [j54]Joaquim Borges
Completely regular codes by concatenating Hamming codes. Adv. Math. Commun. 12(2): 337-349 (2018) - [j53]Josep Rifà
Hadamard full propelinear codes of type Q; rank and kernel. Des. Codes Cryptogr. 86(9): 1905-1921 (2018) - [j52]José Andrés Armario, Iván Bailera, Joaquim Borges
Quasi-Hadamard Full Propelinear Codes. Math. Comput. Sci. 12(4): 419-428 (2018) - 2017
- [j51]Josep Rifà
Completely regular codes with different parameters giving the same distance-regular coset graphs. Discret. Math. 340(7): 1649-1656 (2017) - [j50]Josep Rifà, Victor A. Zinoviev:
About non equivalent completely regular codes with identical intersection array. Electron. Notes Discret. Math. 57: 181-186 (2017) - 2016
- [j49]Iván Bailera, Joaquim Borges
About some Hadamard full propelinear (2t, 2, 2)-codes. Rank and Kernel. Electron. Notes Discret. Math. 54: 319-324 (2016) - [j48]Steven T. Dougherty, Josep Rifà
Ranks and Kernels of Codes From Generalized Hadamard Matrices. IEEE Trans. Inf. Theory 62(2): 687-694 (2016) - 2015
- [j47]Joaquim Borges
Families of nested completely regular codes and distance-regular graphs. Adv. Math. Commun. 9(2): 233-246 (2015) - [j46]Josep Rifà
Erratum to: Intersection of Hamming codes avoiding Hamming subcodes. Des. Codes Cryptogr. 74(1): 283 (2015) - [j45]Josep Rifà
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations. Des. Codes Cryptogr. 75(3): 405-427 (2015) - [j44]Pere Montolio, Josep Rifà
Construction of Hadamard ℤ2 ℤ4 Q8-Codes for Each Allowable Value of the Rank and Dimension of the Kernel. IEEE Trans. Inf. Theory 61(4): 1948-1958 (2015) - [i16]Steven T. Dougherty, Josep Rifà, Mercè Villanueva:
Ranks and Kernels of Codes from Generalized Hadamard Matrices. CoRR abs/1506.08961 (2015) - 2014
- [j43]Joaquim Borges
New families of completely regular codes and their corresponding distance regular coset graphs. Des. Codes Cryptogr. 70(1-2): 139-148 (2014) - [j42]Josep Rifà
On a family of binary completely transitive codes with growing covering radius. Discret. Math. 318: 48-52 (2014) - [j41]Joaquim Borges
Families of completely transitive codes and distance transitive graphs. Discret. Math. 324: 68-71 (2014) - [j40]Josep Rifà-Coma, Emilio Suárez-Canedo:
About a class of Hadamard propelinear codes. Electron. Notes Discret. Math. 46: 289-296 (2014) - [c19]Pere Montolio, Josep Rifà:
Hadamard \(\mathbb{Z}_{2}\mathbb{Z}_{4}Q_{8}\)-Codes: Rank and Kernel. ICMCTA 2014: 273-279 - 2013
- [j39]Joaquim Borges
On the Number of Nonequivalent Propelinear Extended Perfect Codes. Electron. J. Comb. 20(2): 37 (2013) - [j38]Ángel del Río
Families of Hadamard BBZ2BBZ4Q8-Codes. IEEE Trans. Inf. Theory 59(8): 5140-5151 (2013) - [c18]Josep Rifà
Biembeddings of small order hamming STS(n) and APN monomial power permutations. ISIT 2013: 869-873 - [i15]Josep Rifà, Victor A. Zinoviev:
On a family of binary completely transitive codes with growing covering radius. CoRR abs/1303.2547 (2013) - 2012
- [j37]Joaquim Borges
Structural properties of binary propelinear codes. Adv. Math. Commun. 6(3): 329-346 (2012) - [j36]Josep Rifà
Intersection of Hamming codes avoiding Hamming subcodes. Des. Codes Cryptogr. 62(2): 209-223 (2012) - [i14]Ángel del Río, Josep Rifà:
Families of Hadamard Z2Z4Q8-codes. CoRR abs/1211.5251 (2012) - [i13]Josep Rifà, Victor A. Zinoviev:
On two families of binary quadratic bent functions. CoRR abs/1211.5257 (2012) - [i12]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
Self-embeddings of Hamming Steiner triple systems of small order and APN permutations. CoRR abs/1212.5789 (2012) - 2011
- [j35]Helena Rifà-Pous
ℤ2ℤ4-additive perfect codes in Steganography. Adv. Math. Commun. 5(3): 425-433 (2011) - [j34]Josep Rifà
On Lifting Perfect Codes. IEEE Trans. Inf. Theory 57(9): 5918-5925 (2011) - [c17]Helena Rifà-Pous
Spectrum Sharing Models in Cognitive Radio Networks. CyberC 2011: 503-510 - 2010
- [j33]Joaquim Borges
On q-ary linear completely regular codes with ρ=2 and antipodal dual. Adv. Math. Commun. 4(4): 567-578 (2010) - [j32]Joaquim Borges
Z2Z4-linear codes: generator matrices and duality. Des. Codes Cryptogr. 54(2): 167-179 (2010) - [j31]Josep Rifà
New completely regular q-ary codes based on Kronecker products. IEEE Trans. Inf. Theory 56(1): 266-272 (2010) - [c16]Josep Rifà
Product perfect Z2 Z4-linear codes in steganography. ISITA 2010: 696-701 - [i11]Helena Rifà, Josep Rifà, Lorena Ronquillo:
Perfect Z2Z4-linear codes in Steganography. CoRR abs/1002.0026 (2010) - [i10]Josep Rifà, Victor A. Zinoviev:
On lifting perfect codes. CoRR abs/1002.0295 (2010) - [i9]Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
On linear q-ary completely regular codes with rho=2 and dual antipodal. CoRR abs/1002.4510 (2010) - [i8]Josep Rifà, Lorena Ronquillo:
Product Perfect Z2Z4-linear codes in Steganography. CoRR abs/1003.4852 (2010)
2000 – 2009
- 2009
- [j30]Josep Rifà
On a class of binary linear completely transitive codes with arbitrary covering radius. Discret. Math. 309(16): 5011-5016 (2009) - [j29]Helena Rifà-Pous
Product perfect codes and steganography. Digit. Signal Process. 19(4): 764-769 (2009) - [j28]Jaume Pujol, Josep Rifà
Construction of BBZ4-Linear Reed-Muller Codes. IEEE Trans. Inf. Theory 55(1): 99-104 (2009) - [j27]Josep Rifà
On the Intersection of BBZ2BBZ4-Additive Hadamard Codes. IEEE Trans. Inf. Theory 55(4): 1766-1774 (2009) - [c15]Jaume Pujol, Josep Rifà
Construction of Additive Reed-Muller Codes. AAECC 2009: 223-226 - [i7]Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
On linear completely regular codes with covering radius rho=1. Construction and classification. CoRR abs/0906.0550 (2009) - [i6]Joaquim Borges, Cristina Fernández-Córdoba, Josep Rifà:
Propelinear structure of Z_{2k}-linear codes. CoRR abs/0907.5287 (2009) - [i5]Jaume Pujol, Josep Rifà, Lorena Ronquillo:
Construction of Additive Reed-Muller Codes. CoRR abs/0909.3185 (2009) - 2008
- [j26]Joaquim Borges
On non-antipodal binary completely regular codes. Discret. Math. 308(16): 3508-3525 (2008) - [j25]Josep Rifà
On the Intersection of Z2Z4-Additive Perfect Codes. IEEE Trans. Inf. Theory 54(3): 1346-1356 (2008) - [c14]Josep Rifà
On the Kronecker Product Construction of Completely Transitive q-Ary Codes. ICMCTA 2008: 163-170 - [i4]Jaume Pujol, Josep Rifà, Faina I. Solov'eva:
Construction of Z4-linear Reed-Muller codes. CoRR abs/0801.3024 (2008) - [i3]Josep Rifà, Victor A. Zinoviev:
New completely regular q-ary codes based on Kronecker products. CoRR abs/0810.4993 (2008) - 2007
- [j24]Victor A. Zinoviev, Josep Rifà
On new completely regular q-ary codes. Probl. Inf. Transm. 43(2): 97-112 (2007) - [c13]Jaume Pujol, Josep Rifà
Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes. AAECC 2007: 148-157 - [i2]Joaquim Borges, Cristina Fernandez, Jaume Pujol, Josep Rifà, Mercè Villanueva:
Z2Z4-linear codes: generator matrices and duality. CoRR abs/0710.1149 (2007) - 2006
- [j23]Kevin T. Phelps, Josep Rifà
On the additive (ℤ4-linear and non-ℤ4-linear) Hadamard codes: rank and kernel. IEEE Trans. Inf. Theory 52(1): 316-319 (2006) - [c12]Kevin T. Phelps, Josep Rifà
Hadamard Codes of Length 2ts (s Odd). Rank and Kernel. AAECC 2006: 328-337 - [i1]Josep Rifà, Faina I. Solov'eva, Mercè Villanueva:
On the intersection of additive perfect codes. CoRR abs/cs/0612015 (2006) - 2005
- [j22]Kevin T. Phelps, Josep Rifà
Kernels and p-Kernels of pr-ary 1-Perfect Codes. Des. Codes Cryptogr. 37(2): 243-261 (2005) - [j21]Kevin T. Phelps, Josep Rifà
Rank and kernel of binary Hadamard codes. IEEE Trans. Inf. Theory 51(11): 3931-3937 (2005) - 2003
- [j20]Joaquim Borges
The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes. IEEE Trans. Inf. Theory 49(8): 2028-2034 (2003) - [j19]Joaquim Borges
On Z4-linear Preparata-like and Kerdock-like code. IEEE Trans. Inf. Theory 49(11): 2834-2843 (2003) - 2002
- [j18]Kevin T. Phelps, Josep Rifà
On binary 1-perfect additive codes: Some structural properties. IEEE Trans. Inf. Theory 48(9): 2587-2592 (2002) - 2001
- [j17]Josep Rifà
1-Perfect Uniform and Distance Invariant Partitions. Appl. Algebra Eng. Commun. Comput. 11(4): 297-311 (2001) - [j16]Joaquim Borges
On completely regular binary codes and t-designs*. Electron. Notes Discret. Math. 10: 30-33 (2001) - [j15]Cristina Fernández-Córdoba
Every Z2k-Code is a Binary Propelinear Code. Electron. Notes Discret. Math. 10: 100-102 (2001) - [j14]Joaquim Borges
Nonexistence of completely transitive codes with error-correcting capability e>3. IEEE Trans. Inf. Theory 47(4): 1619-1621 (2001) - 2000
- [j13]Andreu Riera, Josep Rifà
Efficient construction of vote-tags to allow open objection to the tally in electronic elections. Inf. Process. Lett. 75(5): 211-215 (2000) - [j12]Joaquim Borges
On the nonexistence of completely transitive codes. IEEE Trans. Inf. Theory 46(1): 279-280 (2000)
1990 – 1999
- 1999
- [j11]Gérard D. Cohen, Josep Rifà
On the Characterization of Linear Uniquely Decodable Codes. Des. Codes Cryptogr. 17(1-3): 87-96 (1999) - [j10]Josep Rifà
Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube. SIAM J. Discret. Math. 12(1): 35-47 (1999) - [j9]Joaquim Borges
A characterization of 1-perfect additive codes. IEEE Trans. Inf. Theory 45(5): 1688-1697 (1999) - 1998
- [j8]Josep Rifà
A New Algebraic Algorithm to Decode the Ternary Golay Code. Inf. Process. Lett. 68(6): 271-274 (1998) - 1997
- [j7]Josep Rifà
Translation-invariant propelinear codes. IEEE Trans. Inf. Theory 43(2): 590-598 (1997) - [c11]Andreu Riera, Joan Borrell, Josep Rifà:
Large scale elections by coordinating electoral colleges. SEC 1997: 349-362 - 1996
- [j6]Joan Borrell
An implementable secure voting scheme. Comput. Secur. 15(4): 327-338 (1996) - 1995
- [j5]Josep Rifà
A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields. Math. Syst. Theory 28(1): 13-20 (1995) - [j4]Josep Rifà
Groups of complex integers used as QAM signals. IEEE Trans. Inf. Theory 41(5): 1512-1517 (1995) - 1993
- [j3]Josep Rifà-Coma
How to Avoid the Cheaters Succeeding in the Key Sharing Scheme. Des. Codes Cryptogr. 3(3): 221-228 (1993) - [j2]Joaquim Borges
A note about multidesigns and extended designs. Discret. Math. 111(1-3): 65-69 (1993) - [c10]Josep Rifà-Coma:
Decoding a bit more than the BCH bound. Algebraic Coding 1993: 287-303 - 1991
- [c9]Josep Rifà, Joan Borrell:
Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields. AAECC 1991: 352-359 - [c8]Josep Rifà
Completely Transitive Codes and Distance Transitive Graphs. AAECC 1991: 360-367 - 1990
- [j1]Josep Rifà
Classification of a class of distance-regular graphs via completely regular codes. Discret. Appl. Math. 26(2-3): 289-300 (1990) - [c7]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
1980 – 1989
- 1988
- [c6]Josep Rifà
On Completely Regular Propelinear Codes. AAECC 1988: 341-355 - 1987
- [c5]Josep M. Basart, Josep Rifà
Covering Radius for Codes Obtained from T(m) Triangular Graphs. AAECC 1987: 16-24 - [c4]Josep Rifà-Coma:
On the Construction of Completely Regular Linear Codes from Distance-Regular Graphs. AAECC 1987: 376-393 - 1986
- [c3]Josep Rifà
Characterization of Completely Regular Codes through P-Polynomial Association Schemes. AAECC 1986: 157-167 - 1985
- [c2]Mercè Griera, Josep Rifà
On S-Sum-Sets and Projective Codes. AAECC 1985: 135-142 - [c1]Llorenç Huguet i Rotger, Josep Rifà
Pseudo-Triple-Sum-Sets and Association Schemes. AAECC 1985: 143-149
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: