Pàgina inicial > Resultats de la cerca: Automorphism group
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 8 registres trobats en 0.03 segons.
Articles, 7 registres trobats
Llibres i col·leccions, 1 registres trobats
Articles 7 registres trobats  
1.
32 p, 607.0 KB Partial permutation decoding and PD-sets for Zps-linear generalized Hadamard codes / Torres-Martín, Adrián (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions) ; Villanueva, M (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
It is known that Zps-linear codes, which are the Gray map image of Zps-additive codes (linear codes over Zps), are systematic and a systematic encoding has been found. This makes Zps-linear codes suitable to apply the permutation decoding method. [...]
2024 - 10.1016/j.ffa.2023.102316
Finite Fields and their Applications, Vol. 93 (January 2024) , art. 102316  
Registre complet - Creative Commons
2.
14 p, 588.1 KB Bielliptic smooth plane curves and quadratic points / Badr, Eslam (Cairo University. Department of Mathematics (Egypt)) ; Bars Cortina, Francesc (Universitat Autònoma de Barcelona. Departament de Matemàtiques)
Let Ck be a smooth plane curve of degree d ≥ 4 defined over a global field k of characteristic p = 0 or p > (d-1)(d-2)/2 (up to an extra condition on Jac(Ck)). Unless the curve is bielliptic of degree four, we observe that it always admits finitely many quadratic points. [...]
2021 - 10.1142/S1793042121500238
International Journal of Number Theory, Vol. 17, Issue 4 (May 2021) , p. 1047-1066  
Registre complet -
3.
20 p, 319.4 KB Partial permutation decoding for binary linear and Z4-linear Hadamard codes / Barrolleta, Roland David ; Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
In this paper, s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary linear Hadamard code H_m of length 2^m , for all m ≥ 4 and 2 ≤ s ≤ floor(2^m/(1+m)) -1, are constructed. [...]
2017 - 10.1007/s10623-017-0342-8
Designs, codes and cryptography, 2017  
Registre complet -
4.
5 p, 2.0 MB PD-sets for Z₄-linear codes : Hadamard and Kerdock codes / Barrolleta, Roland David ; Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s+1, which enable correction up to s errors, for Z₄-linear codes is provided. [...]
2016 - 10.1109/ISIT.2016.7541512
2016 IEEE International Symposium on Information Theory (ISIT), (Aug. 2016) , p. 1317-1321  
Registre complet -
5.
8 p, 1.2 MB Classification of the Z₂ Z₄-linear Hadamard codes and their automorphism groups / Krotov, Denis S. (Sobolev Institute of Mathematics) ; Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
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. [...]
2015 - 10.1109/TIT.2014.2379644
IEEE transactions on information theory, Vol. 61 Núm. 2 (Feb. 2015) , p. 887-894  
Registre complet -
6.
15 p, 315.9 KB On the fixed-point set of an automorphism of a group / Wehrfritz, B. A. F.
Let Ø be an automorphism of a group G. Under variousfiniteness or solubility hypotheses, for example under polycyclicity, the commutator subgroup [G; Ø] has finite index in G if thefixed-point set CG(Ø) of Ø in G isfinite, but not conversely, even for polycyclic groups G. [...]
2013 - 10.5565/PUBLMAT_57113_06
Publicacions matemàtiques, Vol. 57, Núm. 1 (2013) , p. 139-153  
Registre complet -
7.
36 p, 471.6 KB An inner automorphism is only an inner automorphism, but an inner endomorphism can be something strange / Bergman, George M.
The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those au-tomorphisms of G that can be extended, in a functorial manner, to all groups H given with homomorphisms G ! H: (Precise statement in x1. [...]
2012 - 10.5565/PUBLMAT_56112_04
Publicacions matemàtiques, Vol. 56, Núm. 1 ( 2012) , p. 91-126  
Registre complet -

Llibres i col·leccions 1 registres trobats  
1.
7 p, 1002.4 KB On the automorphism groups of the Z₂Z₄-linear Hadamard codes and their classification / Krotov, Denis S. (Sobolev Institute of Mathematics) ; Villanueva, M. (Mercè) (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
It is known that there are exactly ⌊(t−1)/2⌋ and ⌊t/2⌋ nonequivalent Z₂Z₄-linear Hadamard codes of length 2ᵗ , 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 2ᵗ. [...]
Springer 2015 (CIM Series in Mathematical Sciences) - 10.1007/978-3-319-17296-5_25
Coding Theory and Applications, Vol. 3, 2015, p. 237-243  
Registre complet -

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.
Dipòsit Digital de Documents de la UAB :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem