This paper combines improved Hamming codes and parity codes to assure the reliability of memory in presence of multiple bit upsets with low cost overhead.The redundancy bits of improved Hamming codes will be appended ...This paper combines improved Hamming codes and parity codes to assure the reliability of memory in presence of multiple bit upsets with low cost overhead.The redundancy bits of improved Hamming codes will be appended at the end of data bits,which eliminates the overhead of interspersing the redundancy bits at the encoder and decoder.The reliability of memory is further enhanced by the layout architecture of redundancy bits and data bits.The proposed scheme has been implemented in Verilog and synthesized using the Synopsys tools.The results reveal that the proposed method has about 19% less area penalties and 13% less power consumption comparing with the current two-dimensional error codes,and its latency of encoder and decoder is 63% less than that of Hamming codes.展开更多
In this paper, we show that if Wmax 〈 6 for the Hamming code Ham （r, 2）, then all of the nonzero codewords of Ham （r, 2） are minimal and if Wrnax 〈 8 for the extended Hamming code Hfim （r, 2）, then all of the ...In this paper, we show that if Wmax 〈 6 for the Hamming code Ham （r, 2）, then all of the nonzero codewords of Ham （r, 2） are minimal and if Wrnax 〈 8 for the extended Hamming code Hfim （r, 2）, then all of the nonzero codewords ofHfim （r, 2） are minimal, where Wmax is the maximum nonzero weight in Ham （r, 2） and Hfim （r, 2）.展开更多
As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of research.Basically in a SIS scheme,a secret image is shared via shadows and could be reconstructed by havin...As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of research.Basically in a SIS scheme,a secret image is shared via shadows and could be reconstructed by having the required number of them.A major downside of this method is its noise-like shadows,which draw the malicious users'attention.In order to overcome this problem,SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent-looking cover images and then shared.In most of these schemes,the cover image cannot be recovered without distortion,which makes them useless in case of utilising critical cover images such as military or medical images.Also,embedding the secret data in Least significant bits of the cover image,in many of these schemes,makes them very fragile to steganlysis.A reversible IWT-based SIS scheme using Rook polynomial and Hamming code with authentication is proposed.In order to make the scheme robust to steganalysis,the shadow image is embedded in coefficients of Integer wavelet transform of the cover image.Using Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to participants.Also,utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high-quality stego images.展开更多
当 A是特殊的 (n,1,n)等重码和 (n,n,1)等重等距码时 ,通过对两个旧码 A和 B构造一个新码 A B即直和码的分析 ,给出了 A B广义 Ham ming重量与 A、B的广义 Ham ming重量的关系 ;在 A、B是一般情形下 ,对直和码的广义 Ham ming重量进行...当 A是特殊的 (n,1,n)等重码和 (n,n,1)等重等距码时 ,通过对两个旧码 A和 B构造一个新码 A B即直和码的分析 ,给出了 A B广义 Ham ming重量与 A、B的广义 Ham ming重量的关系 ;在 A、B是一般情形下 ,对直和码的广义 Ham ming重量进行了研究。展开更多
基金Sponsored by the Opening Project of National Key Laboratory of Science and Technology on Reliability PhysicsApplication Technology of Electrical Component(Grant No.ZHD200903)
文摘This paper combines improved Hamming codes and parity codes to assure the reliability of memory in presence of multiple bit upsets with low cost overhead.The redundancy bits of improved Hamming codes will be appended at the end of data bits,which eliminates the overhead of interspersing the redundancy bits at the encoder and decoder.The reliability of memory is further enhanced by the layout architecture of redundancy bits and data bits.The proposed scheme has been implemented in Verilog and synthesized using the Synopsys tools.The results reveal that the proposed method has about 19% less area penalties and 13% less power consumption comparing with the current two-dimensional error codes,and its latency of encoder and decoder is 63% less than that of Hamming codes.
文摘In this paper, we show that if Wmax 〈 6 for the Hamming code Ham （r, 2）, then all of the nonzero codewords of Ham （r, 2） are minimal and if Wrnax 〈 8 for the extended Hamming code Hfim （r, 2）, then all of the nonzero codewords ofHfim （r, 2） are minimal, where Wmax is the maximum nonzero weight in Ham （r, 2） and Hfim （r, 2）.
基金Iran National Science Foundation,Grant/Award Number:99009224。
文摘As an effective way to securely transfer secret images,secret image sharing(SIS)has been a noteworthy area of research.Basically in a SIS scheme,a secret image is shared via shadows and could be reconstructed by having the required number of them.A major downside of this method is its noise-like shadows,which draw the malicious users'attention.In order to overcome this problem,SIS schemes with meaningful shadows are introduced in which the shadows are first hidden in innocent-looking cover images and then shared.In most of these schemes,the cover image cannot be recovered without distortion,which makes them useless in case of utilising critical cover images such as military or medical images.Also,embedding the secret data in Least significant bits of the cover image,in many of these schemes,makes them very fragile to steganlysis.A reversible IWT-based SIS scheme using Rook polynomial and Hamming code with authentication is proposed.In order to make the scheme robust to steganalysis,the shadow image is embedded in coefficients of Integer wavelet transform of the cover image.Using Rook polynomial makes the scheme more secure and moreover makes authentication very easy and with no need to share private key to participants.Also,utilising Hamming code lets us embed data with much less required modifications on the cover image which results in high-quality stego images.
