Is there a need for a change in employer branding practices? – a shift in employer attractiveness attributes/dimensions during the last decade

The aim of the paper is to explore the shift in key employer attractiveness (EA) attributes/dimensions in Croatia during the last decade, as well as to explore whether preferred EA attributes/dimensions differ based on individual characteristics. In the theoretical part of the paper the concept and attributes/dimensions of EA are briefly unfolded, together with the elaboration of the shift in potential and current employees’ EA attributes/dimensions preferences during the last period worldwide, and the elaboration of the impact of individual characteristics and contextual conditions on their preferences. In the empirical part of the paper, both the secondary data analysis and the primary research of preferred EA attributes/dimensions are presented. Firstly, 2006 to 2017 results of the national “Employer of the first choice” survey were longitudinally analysed. Secondly, a survey on a sample of 109 graduate management students from the Faculty of Economics and Business – Zagreb was conducted, and the collected data were compared with previous findings. Both secondary and primary data analysis revealed that preferred EA attributes/dimensions have changed over time. Furthermore, EA attributes/dimensions preferences were found to relate to respondents’ gender and age according to secondary data, and to respondents’ gender and income presence according to primary data

Self-dual codes and PD-sets constructed from combinatorial designs

Predmet istraživanja ove doktorske disertacije su kodovi konstruirani iz nekih kombinatoričkih dizajna i njihova svojstva. Uvodno, u prvom su poglavlju izloženi pojmovi iz teorije grupa potrebni u nastavku, te osnove teorije kodiranja, grafova i dizajna. Zatim su u drugom poglavlju disertacije promatrani kodovi razapeti retcima kvocijentne matrice simetričnog (grupovno) djeljivog dizajna (SGDD) s dualnim svojstvom. Definirana je proširena kvocijentna matrica i pokazano je da pod određenim uvjetima retci proširene kvocijentne matrice razapinju samodualan kod u odnosu na određeni skalarni produkt. Također je pokazano da se ponekad lanac kodova može koristiti da pridružimo samodualan kod kvocijentnoj matrici SGDD-a s dualnim svojstvom. Navedeni su rezultati objavljeni u članku [15] čiji su autori Crnković, Mostarac i Rukavina. Tamo su razvijane ideje koje su prezentirali Lander [35] i Wilson [52], te posebno one iz [17], gdje su Crnković i Rukavina dali konstrukciju samodualnih kodova iz proširenih orbitnih matrica simetričnih dizajna. Zatim su opisani i primjeri samodualnih kodova dobivenih opisanom konstrukcijom uz pomoć grafova i digrafova-djeljivih dizajna. Treće poglavlje sadrži konstrukcije samoortogonalnih i samodualnih kodova iz proširenih orbitnih matrica blokovnih dizajna. U njemu su također opisane i konstrukcije samodualnih kodova uz pomoć orbitnih matrica simetričnih dizajna, te analogne konstrukcije pomoću kvocijentnih matrica SGDD-a s dualnim svojstvom, pri čemu su ideje za njih proizašle iz teorema Assmusa, Mezzarobe i Salwacha u [2]. Kao specijalan slučaj jedne od konstrukcija dana je i konstrukcija uz pomoć Hadamardovih dizajna. Opisano je i kako nam Kroneckerov produkt može pomoći u dobivanju samodualnih kodova. Četvrto je poglavlje posvećeno pronalaženju PD-skupova iz flag-tranzitivnih simetričnih dizajna. Za prost broj $p$ neka je $C_p(G)$ $p$-narni kod razapet retcima matrice incidencije $G$ grafa $\Gamma$. Neka je $\Gamma$ incidencijski graf flag-tranzitivnog simetričnog dizajna $\mathcal{D}$. Pokazano je da se bilo koja flag-tranzitivna grupa automorfizama od $\mathcal{D}$ može koristiti kao PD-skup za potpuno ispravljanje pogrešaka za linearan kod $C_p(G)$ (za bilo koji informacijski skup). Dakle, tako dobiveni kodovi mogu se permutacijski dekodirati. Rezultat je poopćen i za kodove iz flag-tranzitivnih SGGD-a s dualnim svojstvom. PD-skupovi dobiveni na opisani način obično su velike kardinalnosti, no proučavanjem primjera kodova proizašlih iz nekih flag-tranzitivnih simetričnih dizajna pokazali smo da se za njih mogu naći manji PD-skupovi za specifične informacijske skupove.The main subject of this thesis are codes constructed from certain combinatorial designs and their properties. We have constructed some self-dual codes obtained with the use of symmetric (group) divisible designs with the dual property. Self-dual codes obtained with the use of block designs have also been constructed. Next, we have shown that codes spanned by the rows of the incidence matrix of the incidence graph of a flag-transitive symmetric design, are permutation decodable. Some necessary concepts from group theory, and also basic concepts from coding theory, graph theory and design theory are introduced in the first chapter. In the second chapter of the thesis we looked at codes spanned by the rows of a quotient matrix of a symmetric (group) divisible design with the dual property. We defined an extended quotient matrix and showed that under certain conditions the rows of the extended quotient matrix span a self-dual code with respect to a certain scalar product. We also showed that sometimes a chain of codes can be used to associate a self-dual code to a quotient matrix of a symmetric group divisible design with the dual property. This was published in the article [15] whose authors are Crnković, Mostarac and Rukavina. There we developed ideas presented by Lander [35] and Wilson [52], and especially from [17], where Crnković and Rukavina gave a construction of self-dual codes from extended orbit matrices of symmetric designs. Then some examples of self-dual codes are given, that were obtained on the described way, using divisible design graphs and divisible design digraphs. The next part of the thesis contains constructions of self-orthogonal and self-dual codes from extended orbit matrices of block designs. It also contains constructions of self-dual codes obtained with the use of orbit matrices of symmetric designs, and analog constructions obtained with the use of quotient matrices of symmetric group divisible designs with the dual property, ideas for which were taken from a theorem of Assmus, Mezzaroba and Salwach in [2]. As a special case of one of the constructions we describe a construction from orbit matrices of Hadamard designs. We also remark how Kronecker product of matrices can help to obtain some new self-dual codes from the previously constructed ones. The last, fourth chapter, is devoted to finding PD-sets from flag-transitive symmetric designs. For any prime $p$ let $C_p(G)$ be the $p$-ary code spanned by the rows of the incidence 85 matrix $G$ of a graph $\Gamma$. Let $\Gamma$ be the incidence graph of a flag-transitive symmetric design $\mathcal{D}$. We showed that any flag-transitive automorphism group of $\mathcal{D}$ can be used as a PD-set for full error correction for the linear code $C_p(G)$ (with any information set). Therefore, such codes derived from flag-transitive symmetric designs can be decoded using permutation decoding. We noticed that PD-sets obtained in the described way are usually of large cardinality, but by studying some examples of codes arising from flag-transitive symmetric designs we showed that smaller PD-sets can be found for them for specific information sets. The result is also generalized for codes obtained from flag-transitive symmetric group divisible designs with the dual property

The digital transformation of Croatian economy compared with EU member states

The modern world is witnessing change on an unprecedented scale, driven by rapid technological advancement and increasingly unpredictable economic and social landscape. Against this background of increasing complexity and volatility of change, there is a need to embrace it and take advantage of the opportunities it brings. Changes brought about by the emergence of digital technologies have prompted the need for digital transformation, not only of the economy, but also of society as a whole. The aim of this paper is to analyse the state of digitalisation in the economy of the Republic of Croatia and compare its digital competitiveness to the economies of other European Union Member States. An analysis of the digital competitiveness of Croatia was conducted using the Croatian Digital Index (Hrvatski Digitalni Indeks), the Digital Economy and Society Index (DESI), and the IMD World Digital Competitiveness Ranking. The results indicate that the Croatian economy has not yet reached the expected level of competitiveness compared to other EU economies

Self-dual codes and PD-sets constructed from combinatorial designs

Predmet istraživanja ove doktorske disertacije su kodovi konstruirani iz nekih kombinatoričkih dizajna i njihova svojstva. Uvodno, u prvom su poglavlju izloženi pojmovi iz teorije grupa potrebni u nastavku, te osnove teorije kodiranja, grafova i dizajna. Zatim su u drugom poglavlju disertacije promatrani kodovi razapeti retcima kvocijentne matrice simetričnog (grupovno) djeljivog dizajna (SGDD) s dualnim svojstvom. Definirana je proširena kvocijentna matrica i pokazano je da pod određenim uvjetima retci proširene kvocijentne matrice razapinju samodualan kod u odnosu na određeni skalarni produkt. Također je pokazano da se ponekad lanac kodova može koristiti da pridružimo samodualan kod kvocijentnoj matrici SGDD-a s dualnim svojstvom. Navedeni su rezultati objavljeni u članku [15] čiji su autori Crnković, Mostarac i Rukavina. Tamo su razvijane ideje koje su prezentirali Lander [35] i Wilson [52], te posebno one iz [17], gdje su Crnković i Rukavina dali konstrukciju samodualnih kodova iz proširenih orbitnih matrica simetričnih dizajna. Zatim su opisani i primjeri samodualnih kodova dobivenih opisanom konstrukcijom uz pomoć grafova i digrafova-djeljivih dizajna. Treće poglavlje sadrži konstrukcije samoortogonalnih i samodualnih kodova iz proširenih orbitnih matrica blokovnih dizajna. U njemu su također opisane i konstrukcije samodualnih kodova uz pomoć orbitnih matrica simetričnih dizajna, te analogne konstrukcije pomoću kvocijentnih matrica SGDD-a s dualnim svojstvom, pri čemu su ideje za njih proizašle iz teorema Assmusa, Mezzarobe i Salwacha u [2]. Kao specijalan slučaj jedne od konstrukcija dana je i konstrukcija uz pomoć Hadamardovih dizajna. Opisano je i kako nam Kroneckerov produkt može pomoći u dobivanju samodualnih kodova. Četvrto je poglavlje posvećeno pronalaženju PD-skupova iz flag-tranzitivnih simetričnih dizajna. Za prost broj $p$ neka je $C_p(G)$ $p$-narni kod razapet retcima matrice incidencije $G$ grafa $\Gamma$. Neka je $\Gamma$ incidencijski graf flag-tranzitivnog simetričnog dizajna $\mathcal{D}$. Pokazano je da se bilo koja flag-tranzitivna grupa automorfizama od $\mathcal{D}$ može koristiti kao PD-skup za potpuno ispravljanje pogrešaka za linearan kod $C_p(G)$ (za bilo koji informacijski skup). Dakle, tako dobiveni kodovi mogu se permutacijski dekodirati. Rezultat je poopćen i za kodove iz flag-tranzitivnih SGGD-a s dualnim svojstvom. PD-skupovi dobiveni na opisani način obično su velike kardinalnosti, no proučavanjem primjera kodova proizašlih iz nekih flag-tranzitivnih simetričnih dizajna pokazali smo da se za njih mogu naći manji PD-skupovi za specifične informacijske skupove.The main subject of this thesis are codes constructed from certain combinatorial designs and their properties. We have constructed some self-dual codes obtained with the use of symmetric (group) divisible designs with the dual property. Self-dual codes obtained with the use of block designs have also been constructed. Next, we have shown that codes spanned by the rows of the incidence matrix of the incidence graph of a flag-transitive symmetric design, are permutation decodable. Some necessary concepts from group theory, and also basic concepts from coding theory, graph theory and design theory are introduced in the first chapter. In the second chapter of the thesis we looked at codes spanned by the rows of a quotient matrix of a symmetric (group) divisible design with the dual property. We defined an extended quotient matrix and showed that under certain conditions the rows of the extended quotient matrix span a self-dual code with respect to a certain scalar product. We also showed that sometimes a chain of codes can be used to associate a self-dual code to a quotient matrix of a symmetric group divisible design with the dual property. This was published in the article [15] whose authors are Crnković, Mostarac and Rukavina. There we developed ideas presented by Lander [35] and Wilson [52], and especially from [17], where Crnković and Rukavina gave a construction of self-dual codes from extended orbit matrices of symmetric designs. Then some examples of self-dual codes are given, that were obtained on the described way, using divisible design graphs and divisible design digraphs. The next part of the thesis contains constructions of self-orthogonal and self-dual codes from extended orbit matrices of block designs. It also contains constructions of self-dual codes obtained with the use of orbit matrices of symmetric designs, and analog constructions obtained with the use of quotient matrices of symmetric group divisible designs with the dual property, ideas for which were taken from a theorem of Assmus, Mezzaroba and Salwach in [2]. As a special case of one of the constructions we describe a construction from orbit matrices of Hadamard designs. We also remark how Kronecker product of matrices can help to obtain some new self-dual codes from the previously constructed ones. The last, fourth chapter, is devoted to finding PD-sets from flag-transitive symmetric designs. For any prime $p$ let $C_p(G)$ be the $p$-ary code spanned by the rows of the incidence 85 matrix $G$ of a graph $\Gamma$. Let $\Gamma$ be the incidence graph of a flag-transitive symmetric design $\mathcal{D}$. We showed that any flag-transitive automorphism group of $\mathcal{D}$ can be used as a PD-set for full error correction for the linear code $C_p(G)$ (with any information set). Therefore, such codes derived from flag-transitive symmetric designs can be decoded using permutation decoding. We noticed that PD-sets obtained in the described way are usually of large cardinality, but by studying some examples of codes arising from flag-transitive symmetric designs we showed that smaller PD-sets can be found for them for specific information sets. The result is also generalized for codes obtained from flag-transitive symmetric group divisible designs with the dual property

Selecting the Flexible Last-Mile Delivery Models Using Multicriteria Decision-Making

Postal service providers can reorganise the last-mile delivery process within the scope of universal service and apply some of the flexible models for the organisation of the delivery. In this paper, the question of the selection of Flexible Last-Mile Delivery Models (FLMDMs) is treated using multicriteria decision-making. We have identified four different sustainable last-mile delivery models with an emphasis on the number of delivery workers. One postal service provider from Europe was selected, where the proposed FLMDMs were tested. The proposed last-mile delivery models are ranked using Multiple Criteria Decision Analysis (MCDA) techniques. In this context, MCDA techniques are used to make a comparative assessment of alternatives. The obtained results suggest the AB delivery model as the optimal choice for the last-mile delivery and complete allocation of the number of delivery workers

Determining Universal Postal Service Accessibility in Postal System by Applying Transport Connectivity Criterion

Univerzalna usluga u poštanskom sustavu omogućuje svakomu stanovniku pojedine države pristup osnovnom skupu poštanskih usluga prema jednakim uvjetima uz određenu razinu kakvoće usluge. Većina zemalja Europske Unije propisuje određene obveze, odnosno kriterije koje davatelji univerzalne usluge moraju ispunjavati vezano uz gustoću elemenata poštanske mreže. Kriteriji se razlikuju od zemlje do zemlje te ne postoji općeprihvaćen način za određivanje gustoće poštanske mreže. U dosadašnjim istraživanjima, dostupnost univerzalne usluge korisnicima analizirala se prvenstveno s aspekta davatelja usluge optimizacijom broja pristupnih točaka poštanske mreže, pri čemu kriterij prometne povezanosti nije bio primijenjen. Gustoća elemenata poštanske mreže u Republici Hrvatskoj uređuje se kao i u većini europskih zemalja nacionalnim regulatornim okvirima. U ovom radu provedena je analiza dostupnosti elemenata poštanske mreže prema postojećim kriterijima te određen pokazatelj dostupnosti usluge, kao osnova za usporedbu i određivanje dostupnosti usluge primjenom kriterija prometne povezanosti. Poseban je naglasak na određivanju dostupnosti poštanske usluge u ruralnom području. U tu svrhu definirano je područje obuhvata usluge, uzimajući u obzir prihvatljiva vremena putovanja za korisnike usluga u ruralnim područjima, te su određene vrijednosti pokazatelja dostupnosti usluge, primjenom kriterija prometne povezanosti. Analizom prihvatljivih vremena putovanja za tri načina pristupa korisnika poštanskom uredu: pješačenjem, bicikliranjem i osobnim vozilom, istražen je utjecaj i promjene vrijednosti pokazatelja dostupnosti. Razvijeni model za određivanje dostupnosti univerzalne usluge korisnicima usluge, primjenom kriterija prometne povezanosti, predstavlja podlogu za analizu utjecaja varijacija broja i rasporeda elemenata poštanske mreže na dostupnost univerzalne usluge.Universal service enables each resident of a certain country access to a basic set of postal services, with equal terms and a certain level of quality of service. Most countries of the European Union regulate certain specification, or criteria that universal service providers must meet, in connection to the density of elements of the postal network. The criteria vary from country to country, and there is no generally accepted method for determining the density of postal network. In previous research the accessibility of the universal service is mostly analysed in terms of the service provider, implementing the optimization of the number of access points of the postal network, where the transport connectivity criterion is not applied. Density of the elements of the postal network in in Republic of Croatia are similar as in most European countries, and is set by the national regulatory frameworks. In proposed research, a detailed analysis of the availability of elements of the postal network under the existing criteria is carried out, where service accessibility indicator is determined as a basis for comparison and determination of the service accessibility, according to the transport connectivity criterion. Special emphasis is on the accessibility of postal services in rural areas. For this purpose, service catchment area will be defined, bearing in mind the acceptable travel time for customers in rural areas, and accessibility indicator is determined, taking into account transport connectivity criterion. By analysing acceptable travel time for three possible travel modes: walking, cycling and by personal vehicle, impact and variation of the accessibility indicator for the proposed travel modes will be determined. Developed model to determine postal service accessibility is a basis for analysing impact of the variation of the number and formation of elements of the postal network on the universal service accessibility

Određivanje dostupnosti elemenata poštanske mreže pomoću primjene gravitacijske metode

The accessibility of postal services is guaranteed by international and domestic regulations. Regulating certain density of postal network elements is the most commonly used mechanism that enables the accessibility of postal services to residents of a given country. Commonly used regulatory measures (criteria) are mainly adopted and supervised by regulatory bodies in the postal services market. This paper analyzes the application of the concept of spatial accessibility in the postal system as well as the analysis of the spatial characteristics of the selected research area. Gravity method was used to calculate the accessibility indicator of postal network elements, and therefore postal services.Dostupnost poštanskih usluga zajamčena je međunarodnim i nacionalnim zakonskim odredbama. Regulacija određene gustoće elemenata poštanske mreže mehanizam je koji se najčešće koristi u ostvarivanju dostupnosti poštanskih usluga stanovnicima određene zemlje. Općenito korištene regulativne mjere (kriteriji) uglavnom se usvajaju i nadgledaju od strane regulativnih tijela na tržištu poštanskih usluga. U ovom se radu analizira primjena koncepta prostorne dostupnosti u poštanskom sustavu, te se analiziraju prostorne karakteristike odabranih istraživanih područja. Pomoću gravitacijske metode napravljen je izračun indikatora dostupnosti elemenata poštanske mreže i poštanskih usluga

A Resistive Voltage Divider for Power Measurements

The paper presents a resistive voltage divider (RVD), developed for power measurements at much higher frequencies than the traditional 50 Hz. The design of the RVD and the methods of its evaluation are described. The RVD is intended to be used in a digital sampling wattmeter application based on National Instruments PXI-4461 Dynamic Signal Analyzer. The design of the divider includes individual copper guards for each resistor, driven by the auxiliary chain of resistors. To reduce the leakage currents, the PTFE terminals are applied between pins of the resistors and the printed circuit board

Self-dual codes and PD-sets constructed from combinatorial designs

Predmet istraživanja ove doktorske disertacije su kodovi konstruirani iz nekih kombinatoričkih dizajna i njihova svojstva. Uvodno, u prvom su poglavlju izloženi pojmovi iz teorije grupa potrebni u nastavku, te osnove teorije kodiranja, grafova i dizajna. Zatim su u drugom poglavlju disertacije promatrani kodovi razapeti retcima kvocijentne matrice simetričnog (grupovno) djeljivog dizajna (SGDD) s dualnim svojstvom. Definirana je proširena kvocijentna matrica i pokazano je da pod određenim uvjetima retci proširene kvocijentne matrice razapinju samodualan kod u odnosu na određeni skalarni produkt. Također je pokazano da se ponekad lanac kodova može koristiti da pridružimo samodualan kod kvocijentnoj matrici SGDD-a s dualnim svojstvom. Navedeni su rezultati objavljeni u članku [15] čiji su autori Crnković, Mostarac i Rukavina. Tamo su razvijane ideje koje su prezentirali Lander [35] i Wilson [52], te posebno one iz [17], gdje su Crnković i Rukavina dali konstrukciju samodualnih kodova iz proširenih orbitnih matrica simetričnih dizajna. Zatim su opisani i primjeri samodualnih kodova dobivenih opisanom konstrukcijom uz pomoć grafova i digrafova-djeljivih dizajna. Treće poglavlje sadrži konstrukcije samoortogonalnih i samodualnih kodova iz proširenih orbitnih matrica blokovnih dizajna. U njemu su također opisane i konstrukcije samodualnih kodova uz pomoć orbitnih matrica simetričnih dizajna, te analogne konstrukcije pomoću kvocijentnih matrica SGDD-a s dualnim svojstvom, pri čemu su ideje za njih proizašle iz teorema Assmusa, Mezzarobe i Salwacha u [2]. Kao specijalan slučaj jedne od konstrukcija dana je i konstrukcija uz pomoć Hadamardovih dizajna. Opisano je i kako nam Kroneckerov produkt može pomoći u dobivanju samodualnih kodova. Četvrto je poglavlje posvećeno pronalaženju PD-skupova iz flag-tranzitivnih simetričnih dizajna. Za prost broj $p$ neka je $C_p(G)$ $p$-narni kod razapet retcima matrice incidencije $G$ grafa $\Gamma$. Neka je $\Gamma$ incidencijski graf flag-tranzitivnog simetričnog dizajna $\mathcal{D}$. Pokazano je da se bilo koja flag-tranzitivna grupa automorfizama od $\mathcal{D}$ može koristiti kao PD-skup za potpuno ispravljanje pogrešaka za linearan kod $C_p(G)$ (za bilo koji informacijski skup). Dakle, tako dobiveni kodovi mogu se permutacijski dekodirati. Rezultat je poopćen i za kodove iz flag-tranzitivnih SGGD-a s dualnim svojstvom. PD-skupovi dobiveni na opisani način obično su velike kardinalnosti, no proučavanjem primjera kodova proizašlih iz nekih flag-tranzitivnih simetričnih dizajna pokazali smo da se za njih mogu naći manji PD-skupovi za specifične informacijske skupove.The main subject of this thesis are codes constructed from certain combinatorial designs and their properties. We have constructed some self-dual codes obtained with the use of symmetric (group) divisible designs with the dual property. Self-dual codes obtained with the use of block designs have also been constructed. Next, we have shown that codes spanned by the rows of the incidence matrix of the incidence graph of a flag-transitive symmetric design, are permutation decodable. Some necessary concepts from group theory, and also basic concepts from coding theory, graph theory and design theory are introduced in the first chapter. In the second chapter of the thesis we looked at codes spanned by the rows of a quotient matrix of a symmetric (group) divisible design with the dual property. We defined an extended quotient matrix and showed that under certain conditions the rows of the extended quotient matrix span a self-dual code with respect to a certain scalar product. We also showed that sometimes a chain of codes can be used to associate a self-dual code to a quotient matrix of a symmetric group divisible design with the dual property. This was published in the article [15] whose authors are Crnković, Mostarac and Rukavina. There we developed ideas presented by Lander [35] and Wilson [52], and especially from [17], where Crnković and Rukavina gave a construction of self-dual codes from extended orbit matrices of symmetric designs. Then some examples of self-dual codes are given, that were obtained on the described way, using divisible design graphs and divisible design digraphs. The next part of the thesis contains constructions of self-orthogonal and self-dual codes from extended orbit matrices of block designs. It also contains constructions of self-dual codes obtained with the use of orbit matrices of symmetric designs, and analog constructions obtained with the use of quotient matrices of symmetric group divisible designs with the dual property, ideas for which were taken from a theorem of Assmus, Mezzaroba and Salwach in [2]. As a special case of one of the constructions we describe a construction from orbit matrices of Hadamard designs. We also remark how Kronecker product of matrices can help to obtain some new self-dual codes from the previously constructed ones. The last, fourth chapter, is devoted to finding PD-sets from flag-transitive symmetric designs. For any prime $p$ let $C_p(G)$ be the $p$-ary code spanned by the rows of the incidence 85 matrix $G$ of a graph $\Gamma$. Let $\Gamma$ be the incidence graph of a flag-transitive symmetric design $\mathcal{D}$. We showed that any flag-transitive automorphism group of $\mathcal{D}$ can be used as a PD-set for full error correction for the linear code $C_p(G)$ (with any information set). Therefore, such codes derived from flag-transitive symmetric designs can be decoded using permutation decoding. We noticed that PD-sets obtained in the described way are usually of large cardinality, but by studying some examples of codes arising from flag-transitive symmetric designs we showed that smaller PD-sets can be found for them for specific information sets. The result is also generalized for codes obtained from flag-transitive symmetric group divisible designs with the dual property