<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D"><efrbr-work:titleOfTheWork>New bounds on the total squared correlation and optimum design of DS-CDMA
binary signature sets</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D"><efrbr-expression:titleOfTheExpression>New bounds on the total squared correlation and optimum design of DS-CDMA
binary signature sets</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-23</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2003</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The Welch lower bound on the total-squaredcorrelation
(TSC) of signature sets is known to be tight
for real-valued signatures and loose for binary signatures
whose number is not a multiple of 4. In this paper, we
derive new bounds on the TSC of binary signature sets
for any number of signatures K and any signature length
L: For almost all K; L in f1; 2;::: ; 200g, we develop
simple algorithms for the design of optimum binary
signature sets that achieve the new bound.</efrbr-expression:summarizationOfContent><efrbr-expression:contextForTheExpression>Δημοσίευση σε επιστημονικό περιοδικό </efrbr-expression:contextForTheExpression><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">IEEE Transactions on Communications</efrbr-expression:note><efrbr-expression:note type="journal number">51</efrbr-expression:note><efrbr-expression:note type="page range">48-51</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~gkarystinos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Karystinos Georgios
            Καρυστινος Γεωργιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="F98D14DD-8128-4D9D-8EF6-044DC23643D5"><efrbr-person:nameOfPerson vocabulary="">
             Pados Dimitris A.
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-concept:concept identifier="5F93D3EE-E4EC-451E-A351-D7309C680C9B"><efrbr-concept:termForTheConcept>
            Binary sequences
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="8A2691B2-2BFD-423C-94E8-04674B12FB66"><efrbr-concept:termForTheConcept>
            code division multiaccess
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="51CF7F72-13D9-49EF-9692-63D495121C4C"><efrbr-concept:termForTheConcept>
            codes
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="177CE40E-D829-42FC-85A0-7C985D629051"><efrbr-concept:termForTheConcept>
            signal design
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="http://users.isc.tuc.gr/~gkarystinos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="http://users.isc.tuc.gr/~gkarystinos"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="F98D14DD-8128-4D9D-8EF6-044DC23643D5"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="5F93D3EE-E4EC-451E-A351-D7309C680C9B"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="8A2691B2-2BFD-423C-94E8-04674B12FB66"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="51CF7F72-13D9-49EF-9692-63D495121C4C"/><efrbr-subject:hasSubject sourceEntity="work" targetEntity="concept" sourceURI="http://purl.tuc.gr/dl/dias/05ECF24A-E5F8-4E95-8698-4A443994131D" targetURI="177CE40E-D829-42FC-85A0-7C985D629051"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>