Pregled bibliografske jedinice broj: 1063728
Searching for Hadamard Partitioned Difference Families
Searching for Hadamard Partitioned Difference Families // Combinatorics 2018
Arco, Italija, 2018. str. 1-1 (predavanje, međunarodna recenzija, kratko priopćenje, znanstveni)
CROSBI ID: 1063728 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Searching for Hadamard Partitioned Difference
Families
Autori
Nakić, Anamari
Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, kratko priopćenje, znanstveni
Izvornik
Combinatorics 2018
/ - , 2018, 1-1
Skup
Combinatorics 2018 conference
Mjesto i datum
Arco, Italija, 03.06.2018. - 09.06.2018
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Hadamard Partitioned Difference Families
Sažetak
A (G, [k_1, ..., k_t], lambda) partitioned difference family (PDF) is a partition of an additive group G into sets (it blocks) of sizes k_1, ..., k_t, with the property that every non- zero element of G is covered lambda times by the list of differences of the blocks. This notion was introduced for the construction of optimal constant composition codes. If G has order 2*lambda, we speak of a Hadamard PDF. The importance of PDFs with this property lies in the fact that each of them gives rise to an infinite class of PDFs in suitable supergroups of G. If D is a Hadamard difference set in a group $G$ of order 4u^2, then {; ; D, G\setminus D}; ; is clearly a Hadamard (G, [2u^2-u, 2u^2+u], 2u^2)- PDF. Some work in progress on the hard task of finding Hadamard PDFs which are not of the above form is presented.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb
Profili:
Anamari Nakić
(autor)