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.展开更多
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）.展开更多
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.展开更多
The undetected error probability and error detection capability of shortened Hamming codes and their dual codes are studied in this paper. We also obtain some interesting properties for the shortened Simplex codes.
We study the representations of code vertex operator superalgebras resulting from a binary linear code which contains codewords of odd weight. We also show that there exists only one set of seven mutually orthogonal c...We study the representations of code vertex operator superalgebras resulting from a binary linear code which contains codewords of odd weight. We also show that there exists only one set of seven mutually orthogonal conformal vectors with central charge 1/2 in the Hamming code vertex operator superalgebra MH7. Phrthermore, we classify all the irreducible weak MH7-modules.展开更多
Embedded RAM blocks（BRAMs） in field programmable gate arrays（FPGAs） are susceptible to single event effects（SEEs） induced by environmental factors such as cosmic rays, heavy ions, alpha particles and so on. As t...Embedded RAM blocks（BRAMs） in field programmable gate arrays（FPGAs） are susceptible to single event effects（SEEs） induced by environmental factors such as cosmic rays, heavy ions, alpha particles and so on. As technology scales, the issue will be more serious. In order to tackle this issue, two different error correcting codes（ECCs）, the shortened Hamming codes and shortened BCH codes, are investigated in this paper. The concrete design methods of the codes are presented. Also, the codes are both implemented in flash-based FPGAs. Finally, the synthesis report and simulation results are presented in the paper. Moreover, heavy-ion experiments are performed,and the experimental results indicate that the error cross-section of the device using the shortened Hamming codes can be reduced by two orders of magnitude compared with the device without mitigation, and no errors are discovered in the experiments for the device using the shortened BCH codes.展开更多
基金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.
文摘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）.
基金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.
基金supported by the National Natural Science Foundation of China, No. 69802008.
文摘The undetected error probability and error detection capability of shortened Hamming codes and their dual codes are studied in this paper. We also obtain some interesting properties for the shortened Simplex codes.
文摘We study the representations of code vertex operator superalgebras resulting from a binary linear code which contains codewords of odd weight. We also show that there exists only one set of seven mutually orthogonal conformal vectors with central charge 1/2 in the Hamming code vertex operator superalgebra MH7. Phrthermore, we classify all the irreducible weak MH7-modules.
基金Supported by National Natural Science Foundation of China(11079045,11179003 and 11305233)
文摘Embedded RAM blocks（BRAMs） in field programmable gate arrays（FPGAs） are susceptible to single event effects（SEEs） induced by environmental factors such as cosmic rays, heavy ions, alpha particles and so on. As technology scales, the issue will be more serious. In order to tackle this issue, two different error correcting codes（ECCs）, the shortened Hamming codes and shortened BCH codes, are investigated in this paper. The concrete design methods of the codes are presented. Also, the codes are both implemented in flash-based FPGAs. Finally, the synthesis report and simulation results are presented in the paper. Moreover, heavy-ion experiments are performed,and the experimental results indicate that the error cross-section of the device using the shortened Hamming codes can be reduced by two orders of magnitude compared with the device without mitigation, and no errors are discovered in the experiments for the device using the shortened BCH codes.
