Home > Research literature > UAB research groups literature > Research Centres and Groups (research output) > Engineering > Combinatorics, Coding and Security Group (CCSG)
Combinatorics, Coding and Security Group (CCSG)
The Combinatorics, Coding and Security Group (CCSG) is a research group in the Department of Information and Communications Engineering (DEIC) at the Universitat Autònoma de Barcelona (UAB).

Group CCSG has been uninterruptedly working since 1987 in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Cryptography, Electronic Voting, Network Coding.

Usage statistics Most popular
Search 49 records for:
Search Tips
Advanced Search
Latest additions:
2023-09-30
14:04
15 p, 403.1 KB Fast and Efficient Entropy Coding Architectures for Massive Data Compression / Aulí Llinàs, Francesc (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
The compression of data is fundamental to alleviating the costs of transmitting and storing massive datasets employed in myriad fields of our society. Most compression systems employ an entropy coder in their coding pipeline to remove the redundancy of coded symbols. [...]
2023 - 10.3390/technologies11050132
Technologies, Vol. 11, Issue 5 (September 2023) , art. 132  
Detailed record - Creative Commons
2023-07-18
06:14
12 p, 537.4 KB The space of models in machine learning : using Markov chains to model transitions / Torra, Vicenç (Umeå University. Department Computing Science) ; Taha, Mariam (Umeå University. Department Computing Science) ; Navarro-Arribas, Guillermo (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Machine and statistical learning is about constructing models from data. Data is usually understood as a set of records, a database. Nevertheless, databases are not static but change over time. We can understand this as follows: there is a space of possible databases and a database during its lifetime transits this space. [...]
2021 - 10.1007/s13748-021-00242-6
Progress in Artificial Intelligence, Vol. 10, Issue 3 (September 2021) , p. 321-332  
Detailed record - Creative Commons
2023-07-18
06:14
19 p, 1.3 MB A fair protocol for data trading based on Bitcoin transactions / Delgado-Segura, Sergi (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Pérez-Solà, Cristina (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Navarro-Arribas, Guillermo (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Herrera-Joancomartí, Jordi (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
On-line commercial transactions involve an inherent mistrust between participant parties since, sometimes, no previous relation exists between them. Such mistrust may be a deadlock point in a trade transaction where the buyer does not want to perform the payment until the seller sends the goods and the seller does not want to do so until the buyer pays for the purchase. [...]
2020 - 10.1016/j.future.2017.08.021
Future generation computer systems, Vol. 107 (June 2020) , p. 832-840  
Detailed record -
2023-07-18
06:14
25 p, 692.8 KB Message anonymity on predictable opportunistic networks / Chen, D. (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Navarro-Arribas, Guillermo (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Pérez-Solà, Cristina (Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3)) ; Borrell i Viader, Joan (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
A Predictable Opportunistic Network (POppNet) is a network where end-to-end connectivity is not guaranteed, and node communication happens in an opportunistic manner, but the behavior of the network can be predicted in advance. [...]
2019 - 10.1007/s12652-019-01393-0
Journal of Ambient Intelligence and Humanized Computing, (July 2019)  
Detailed record -
2023-07-18
06:14
14 p, 7.1 MB Double-spending prevention for Bitcoin zero-confirmation transactions / Pérez-Solà, Cristina (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Delgado-Segura, Sergi (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Navarro-Arribas, Guillermo (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Herrera-Joancomartí, Jordi (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Zero-confirmation transactions, i. e. transactions that have been broadcast but are still pending to be included in the blockchain, have gained attention in order to enable fast payments in Bitcoin, shortening the time for performing payments. [...]
2019 - 10.1007/s10207-018-0422-4
International Journal of Information Security, Vol. 18, Issue 4 (August 2019) , p. 451-463  
Detailed record -
2023-07-18
06:14
11 p, 122.7 KB Agents in a privacy-preserving world / Galván, Edgar (Maynooth University. Department of Computer Science) ; Garcia-Alfaro, Joaquin (Institut Polytechnique de Paris) ; Navarro-Arribas, Guillermo (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Torra i Reventós, Vicenç (Umeå University. Department of Computing Science)
Privacy is a fluid concept. It is both difficult to define and difficult to achieve. The large amounts of data currently available at hands of companies and administrations increase individual concerns on what is yet to be known about us. [...]
2021
Transactions on Data Privacy, Vol. 14, Issue 1 (April 2021) , p. 53-63  
Detailed record -
2021-09-06
17:23
13 p, 516.1 KB Rank and kernel of additive generalised Hadamard codes / Dougherty, Steven T. (University of Scranton. Department of Mathematics) ; Rifà i Coma, Josep (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
A subset of a vector space Fn q is additive if it is a linear space over the field Fp, where q = pe, p prime, and e > 1. Bounds on the rank and dimension of the kernel of additive generalised Hadamard (additive GH) codes are established. [...]
2021 - 10.1109/TIT.2021.3100433
IEEE Transactions on Information Theory, Vol. 67, Issue 11 (November 2021) , p. 7210-7220  
Detailed record -
2019-05-13
15:06
2 p, 111.8 KB Example 5. Generalized Hadamard full propelinear codes / Armario, José Andrés (Universidad de Sevilla) ; Bailera, Ivan (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Egan, Ronan (National University of Ireland Galway)
We present an example of a generalized Hadamard matrix and a list of permutations which correspond to a generalized Hadamard full propelinear code.
Universitat Autònoma de Barcelona 2019 - 10.5565/ddd.uab.cat/204295
3 documents
Detailed record - Creative Commons
2018-03-13
15:41
9 p, 1.5 MB On primitive constant dimension codes and a geometrical sunflower bound / Barrolleta, Roland David (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Storme, Leo (Universiteit Gent. Department of Mathematics) ; Suárez Canedo, E. (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Vandendriessche, Peter (Universiteit Gent. Department of Mathematics)
In this paper we study subspace codes with constant intersection dimension (SCIDs). We investigate the largest possible dimension spanned by such a code that can yield non-sunflower codes, and classify the examples attaining equality in that bound as one of two infinite families. [...]
2017 - 10.3934/amc.2017055
Advances in mathematics of communications, Vol. 11, issue 4 (2017) , p. 757-765  
Detailed record -
2018-03-13
15:27
12 p, 2.1 MB On Zpr Zps-additive cyclic codes / Borges, J. (Joaquim) (Joaquim) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Fernández Córdoba, Cristina (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Ten-Valls, Roger (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Llegiu l'abstract consultant l'article.
2016 - 10.3934/amc.2018011
Advances in mathematics of communications, Vol. 12, issue 1 (Feb. 2018) p. 169-179  
Detailed record -
UAB Digital Repository of Documents :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.6
Maintained by ddd.bib@uab.cat  :: Metadata license:
Last updated: 24 Apr 2024, 09:30
Working with