{"title":"Algorithm to compute term rank of a matrix based on the construction a bipartite graph","authors":"Huu Loc Pham","doi":"10.1109/EnT50437.2020.9431269","DOIUrl":null,"url":null,"abstract":"We consider method to compute term rank of a matrix based on the construction a bipartite graph. The term rank of a matrix $A$ is defined to be the minimum number of rows and columns that contain all non-zero elements of the matrix. In this article, we will discuss the Ford-Fulkerson algorithm for the maximum flow problem. Next, we propose modeling the algorithm in the MATLAB environment. The application of this algorithm for evaluating the characteristics of codes in a term-rank metric is considered.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference Engineering and Telecommunication (En&T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EnT50437.2020.9431269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We consider method to compute term rank of a matrix based on the construction a bipartite graph. The term rank of a matrix $A$ is defined to be the minimum number of rows and columns that contain all non-zero elements of the matrix. In this article, we will discuss the Ford-Fulkerson algorithm for the maximum flow problem. Next, we propose modeling the algorithm in the MATLAB environment. The application of this algorithm for evaluating the characteristics of codes in a term-rank metric is considered.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
