TY - JOUR
T1 - Protecting Multi-Level Memories from Jamming Using Q-ary Expurgated Robust Codes
AU - Neumeier, Yaara
AU - Keren, Osnat
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2021/3/1
Y1 - 2021/3/1
N2 - Robust codes can effectively detect jamming in qq-ary memories for q=2tq=2t. When qq is not a power of two, a binary information word has to be converted into a qq-ary word prior to the encoding. This conversion expurgates the code since some of the qq-ary codewords are never used. Unless properly designed, expurgation can significantly degrade the effectiveness of the code in terms of its error detection capability. This article analyzes the error masking probability of an expurgated robust code when applied to qq-ary memories. It is shown that by wisely designing the converter, this degradation can be minimized, and in some cases, the code's efficiency can be superior to the original code.
AB - Robust codes can effectively detect jamming in qq-ary memories for q=2tq=2t. When qq is not a power of two, a binary information word has to be converted into a qq-ary word prior to the encoding. This conversion expurgates the code since some of the qq-ary codewords are never used. Unless properly designed, expurgation can significantly degrade the effectiveness of the code in terms of its error detection capability. This article analyzes the error masking probability of an expurgated robust code when applied to qq-ary memories. It is shown that by wisely designing the converter, this degradation can be minimized, and in some cases, the code's efficiency can be superior to the original code.
UR - http://www.scopus.com/inward/record.url?scp=85099546049&partnerID=8YFLogxK
U2 - 10.1109/tdsc.2021.3050088
DO - 10.1109/tdsc.2021.3050088
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85099546049
SN - 1545-5971
VL - 18
SP - 936
EP - 948
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
IS - 2
M1 - 9316777
ER -