.png){kind=icon}
返回
M-Array Based on Non-Zero Maps
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3071877.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Two-dimensional maximum area array (m-array) is a typical pseudo-random array with speciflc window property - all sub-windows are globally unique. M-array constructed by Formula-Method-Based encoding algorithm features a big difference between the number of rows and columns. EnumerationMethod-Based encoding algorithm only constructs small-size m-array with high computational complexity and low success rate. Based on the characteristics of Galois Fields, a new method of m-array construction based on non-zero maps theory is proposed and the theoretical proof is presented. Given symbols p and sub-window size m fl n as input, m-array with a large array size and close numbers of rows and columns is constructed by dividing and splicing m-sequence. Comparing with existing methods, the advantages of the algorithm include larger array size, more balanced number of rows and columns, and lower computational complexity. If needed, the method in this paper is flexible enough that the number of rows and columns of m-array can also be adjusted within a certain range, meaning that m-array with speciflc rows and columns ratio can be constructed.
Keyword:
M-array
non-zero maps
pseudo-random array
window property
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
ReRec: A Divide-and-Conquer Approach to Recommendation Based on Repeat Purchase Behaviors of Users in Community E-Commerce.png)
Mathematics
OAAI
MathematicsIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容