{"title":"New Distance Concept and Graph Theory Approach for Certain Coding Techniques Design and Analysis","authors":"K. Ouahada, H. C. Ferreira","doi":"10.1515/caim-2019-0012","DOIUrl":null,"url":null,"abstract":"Abstract A New graph distance concept introduced for certain coding techniques helped in their design and analysis as in the case of distance-preserving mappings and spectral shaping codes. A graph theoretic construction, mapping binary sequences to permutation sequences and inspired from the k-cube graph has reached the upper bound on the sum of the distances for certain values of the length of the permutation sequence. The new introduced distance concept in the k-cube graph helped better understanding and analyzing for the first time the concept of distance-reducing mappings. A combination of distance and the index-permutation graph concepts helped uncover and verify certain properties of spectral null codes, which were previously difficult to analyze.","PeriodicalId":37903,"journal":{"name":"Communications in Applied and Industrial Mathematics","volume":"10 1","pages":"53 - 70"},"PeriodicalIF":0.3000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/caim-2019-0012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
Abstract A New graph distance concept introduced for certain coding techniques helped in their design and analysis as in the case of distance-preserving mappings and spectral shaping codes. A graph theoretic construction, mapping binary sequences to permutation sequences and inspired from the k-cube graph has reached the upper bound on the sum of the distances for certain values of the length of the permutation sequence. The new introduced distance concept in the k-cube graph helped better understanding and analyzing for the first time the concept of distance-reducing mappings. A combination of distance and the index-permutation graph concepts helped uncover and verify certain properties of spectral null codes, which were previously difficult to analyze.
期刊介绍：
Communications in Applied and Industrial Mathematics (CAIM) is one of the official journals of the Italian Society for Applied and Industrial Mathematics (SIMAI). Providing immediate open access to original, unpublished high quality contributions, CAIM is devoted to timely report on ongoing original research work, new interdisciplinary subjects, and new developments. The journal focuses on the applications of mathematics to the solution of problems in industry, technology, environment, cultural heritage, and natural sciences, with a special emphasis on new and interesting mathematical ideas relevant to these fields of application . Encouraging novel cross-disciplinary approaches to mathematical research, CAIM aims to provide an ideal platform for scientists who cooperate in different fields including pure and applied mathematics, computer science, engineering, physics, chemistry, biology, medicine and to link scientist with professionals active in industry, research centres, academia or in the public sector. Coverage includes research articles describing new analytical or numerical methods, descriptions of modelling approaches, simulations for more accurate predictions or experimental observations of complex phenomena, verification/validation of numerical and experimental methods; invited or submitted reviews and perspectives concerning mathematical techniques in relation to applications, and and fields in which new problems have arisen for which mathematical models and techniques are not yet available.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
