{"title":"Strongly Regular Graphs from Weakly Regular Plateaued Functions*","authors":"Sihem Mesnager, Ahmet Sınak","doi":"10.1109/IWSDA46143.2019.8966118","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966118","url":null,"abstract":"This paper presents the first construction of strongly regular graphs and association schemes from weakly regular plateaued functions over the finite fields of odd characteristic. Indeed, we generalize the construction method of strongly regular graphs from weakly regular bent functions given by Chee et al. [Journal of Algebraic Combinatorics, 34(2), 251–266, 2011] to weakly regular plateaued functions. In this framework, we construct strongly regular graphs with three types of parameters from weakly regular plateaued functions with some homogeneous conditions. We also construct a family of association schemes of class p from weakly regular plateaued p-ary functions.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Convex Set of Doubly Substochastic Matrices","authors":"Lei Deng","doi":"10.1109/IWSDA46143.2019.8966124","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966124","url":null,"abstract":"Denote $mathcal{A}$ as the set of all doubly substochastic m×n matrices and let k be a positive integer. Let $mathcal{A}_k$ be the set of all 1/k-bounded doubly substochastic m × n matrices, i.e., $mathcal{A}_k triangleq {E in mathcal{A}:e_{i,j} in [0,1/k],forall i = 1,2, cdots ,m,j = 1,2, cdots ,n}$. Denote ℬk as the set of all matrices in $mathcal{A}_k$ whose entries are either 0 or 1/k. We prove that $mathcal{A}_k$ is the convex hull of all matrices in ℬk. In addition, we introduce an application of this result in communication system.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}