已收录 272818 条政策
 政策提纲
  • 暂无提纲
Low complexity two-dimensional weight-constrained codes
[摘要] Two low complexity coding techniques are described for mapping arbitrary data to and from mxn binary arrays in which the Hamming weight of each row (respectively, column) is at most n/2 (respectively, m/2). One technique is based on flipping rows and columns of an arbitrary binary array until the Hamming weight constraint is satisfied in all rows and columns, and the other is based on a certain explicitly constructed "antipodal" matching between layers of the Boolean lattice. Both codes have a redundancy of roughly m+n and may have applications in next generation resistive memory technologies.
[发布日期]  [发布机构] HP Development Company
[效力级别]  [学科分类] 计算机科学(综合)
[关键词] Boolean lattice;resistive memory;two-dimensional coding;weight-constrained codes [时效性] 
   浏览次数:16      统一登录查看全文      激活码登录查看全文