Pasar al contenido principal

LA CODIFICACION DE LA INFORMACION PARA EL ALMACENAMIENTO DISTRIBUIDO Y LA AUTENTICACION EN REDES SOCIALES

TIN2010-17358

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 10
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Classification of the Z₂ Z₄-linear Hadamard codes and their automorphism groups

  • Krotov, Denis S.
  • Villanueva, M.|||0000-0001-6179-0833
A Z₂ Z₄-linear Hadamard code of length α + 2β = 2t is a binary Hadamard code, which is the Gray map image of a Z₂ Z₄-additive code with α binary coordinates and β quaternary coordinates. It is known that there are exactly ⌊t-1/2⌋ and ⌊t/2⌋ nonequivalent Z₂ Z₄-linear Hadamard codes of length 2t, with α = 0 and α ≠ 0, respectively, for all t ≥ 3. In this paper, it is shown that each Z₂ Z₄-linear Hadamard code with α = 0 is equivalent to a Z₂ Z₄-linear Hadamard code with α ≠ 0, so there are only ⌊t/2⌋ nonequivalent Z₂ Z₄-linear Hadamard codes of length 2t. Moreover, the order of the monomial automorphism group for the Z2Z4-additive Hadamard codes and the permutation automorphism group of the corresponding Z₂ Z₄-linear Hadamard codes are given.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Efficient representation of binary nonlinear codes, constructions and minimum distance computation

  • Villanueva, M.|||0000-0001-6179-0833
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Zeng, Fanxuan
A binary nonlinear code can be represented as a union of cosets of a binary linear subcode. In this paper, the complexity of some algorithms to obtain this representation is analyzed. Moreover, some properties and constructions of new codes from given ones in terms of this representation are described. Algorithms to compute the minimum distance of binary nonlinear codes, based on known algorithms for linear codes, are also established, along with an algorithm to decode such codes. All results are written in such a way that they can be easily transformed into algorithms, and the performance of these algorithms is evaluated.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Permutation decoding of Z₂Z₄-linear codes

  • Bernal, José Joaquín
  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M.|||0000-0001-6179-0833
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codessuch as Z₂Z₄ -linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As particular examples, this permutation decoding method is applied to some Hadamard Z₂Z₄ -linear codes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

About a class of Hadamard propelinear codes

  • Rifà, Josep|||0000-0001-9199-4001
  • Suárez Canedo, E.
This article aims to explore the algebraic structure of Hadamard propelinear codes, which are not abelian in general but they have good algebraic and combinatorial properties. We construct a subclass of Hadamard propelinear codes which enlarges the family of the Hadamard translation invariant propelinear codes. Several papers have been devoted to the relations between difference sets, t-designs, cocyclic-matrices and Hadamard groups, and we present a link between them and a class of Hadamard propelinear codes, which we call full propelinear. Finally, as an exemplification, we provide a full propelinear structure for all Hadamard codes of length sixteen.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Self-embeddings of Hamming Steiner triple systems of small order and APN permutations

  • Rifà, Josep|||0000-0001-9199-4001
  • Solov'eva, Faina I.
  • Villanueva, M.|||0000-0001-6179-0833
The classification, up to isomorphism, of all self-embedding monomial power permutations of Hamming Steiner triple systems of order n = 2 m - 1 for small m (m ≤ 22), is given. As far as we know, for m ∈ {5, 7, 11, 13, 17, 19}, all given self-embeddings in closed surfaces are new. Moreover, they are cyclic for all m and nonorientable at least for all m ≤ 19. For any non prime m, the nonexistence of such self-embeddings in a closed surface is proven. The rotation line spectrum for self-embeddings of Hamming Steiner triple systems in pseudosurfaces with pinch points as an invariant to distinguish APN permutations or, in general, to classify permutations, is also proposed. This invariant applied to APN monomial power permutations gives a classification which coincides with the classification of such permutations via CCZ-equivalence, at least up to m ≤ 17.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Nonlinear q-ary codes, constructions and minimum distance computation

  • Villanueva, M.|||0000-0001-6179-0833
  • Zeng, Fanxuan
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
A nonlinear code can be represented as the union of cosets of a linear subcode. Properties and constructions of new codes from given ones in terms of this representation can be described. Algorithms to compute the minimum distance of nonlinear codes, based on known algorithms for linear codes, are also established. Moreover, the performance of these algorithms is studied and an estimation of the number of enumerated codewords needed in the computations is given.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Binary codes, binary codes databases

  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
The research group CCSG (Combinatorics, Coding and Security Group) is one of the research groups in the dEIC (Department of Information and Communications Engineering) at the UAB (Universitat Autònoma de Barcelona) in Spain. From 1987 the team CCSG has been uninterruptedly working in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Teledetection, Cryptography, Electronic Voting, e-Auctions, Mobile Agents, etc. The more important know-how of CCSG is about algorithms for forward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata and Preparata-like codes, (extended) nonlinear 1-perfect codes, Z4-linear codes, Z2Z4-linear codes, etc.; computations of the rank and the dimension of the kernel for nonlinear codes as binary 1-perfect codes, q-ary 1-perfect codes, Preparata codes, Hadamard codes, Kerdock codes, quaternary Reed-Muller codes, etc.; the existence and structural properties for 1-perfect codes, uniformly packed codes, completely regular codes, completely transitive codes, etc...
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Q-ary codes

  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
The research group CCSG (Combinatorics, Coding and Security Group) is one of the research groups in the dEIC (Department of Information and Communications Engineering) at the UAB (Universitat Aut'onoma de Barcelona) in Spain. From 1987 the team CCSG has been uninterruptedly working in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Teledetection, Cryptography, Electronic Voting, e-Auctions, Mobile Agents, etc. The more important know-how of CCSG is about algorithms for forward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata and Preparata-like codes, (extended) nonlinear 1-perfect codes, Z4-linear codes, Z2Z4-linear codes, etc.; computations of the rank and the dimension of the kernel for nonlinear codes as binary 1-perfect codes, q-ary 1-perfect codes, Preparata codes, Hadamard codes, Kerdock codes, quaternary Reed-Muller codes, etc.; the existence and structural properties for 1-perfect codes, uniformly packed codes, completely regular codes, completely transitive codes, etc.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Z2Z4-additive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Gastón Brasó, Bernat
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Rifà, Josep|||0000-0001-9199-4001
  • Villanueva, M.|||0000-0001-6179-0833
The Combinatoric, Coding and Security Group (CCSG) is a research group in the Department of Information and Communications Engineering (DEIC) at the Universitat Aut'onoma de Barcelona (UAB). The research 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, etc. The members of the group have been producing mainly results on optimal coding. Specifically, the research has been focused on uniformly-packed codes; perfect codes in the Hamming space; perfect codes in distance-regular graphs; the classification of optimal codes of a given length; and codes which are close to optimal codes by some properties, for example, Reed-Muller codes, Preparata codes, Kerdock codes and Hadamard codes. Part of the research developed by CCSG deals with Z2Z4-linear codes. There are no symbolic software to work with these codes, so the members of CCSG have been developing this new package that supports the basic facilities for Z2Z4-additive codes. Specifically, this Magma package generalizes most of the known functions for codes over the ring Z4, which are subgroups of Zn4, to Z2Z4-additive codes, which are subgroups of Zγ2 × Zδ4, maintaining all the functionality for codes over Z4 and adding new functions which, not only generalize the previous ones, but introduce new variants when it is needed. A beta version of this new package for Z2Z4-additive codes and this manual with the description of all functions can be downloaded from the web page http://ccsg.uab.cat. For any comment or further information about this package, you can send an e-mail to support-ccsg@deic.uab.cat. The authors would like to thank Lorena Ronquillo, Jaume Pernas, Roger Ten-Valls, and Cristina Diéguez for their contributions developing some parts of this Magma package.