.png){kind=icon}
返回
T-Code: 3-Erasure Longest Lowest-Density MDS Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/JSAC.2010.100218.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study longest lowest-density MDS codes, a simple kind of multi-erasure array code with optimal redundancy and minimum update penalty. We prove some basic structure properties for longest lowest-density MDS codes. We define a perfect property for near-resolvable block designs (NRBs) and establish a bijection between 3-erasure longest lowest-density MDS codes (T-Codes) and perfect NRB(3k + 1, 3, 2)s. We present a class of NRB(3k + 1, 3, 2) s, and prove that it produces a family of T-Codes. This family is infinite assuming Artin's Conjecture. We also test some other NRBs and find some T-Code instances outside of this family.
Keyword:
3-erasure correcting codes
parity array codes
near-resolvable design
perfect one-factorization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
引用论文
Epigallocatechin gallate prevents senescence by alleviating oxidative stress and inflammation in WI-38 human embryonic fibroblasts.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏
分享收藏
查看更多内容