Design of signature circuits based on weight distributions of error-correcting codes

Author(s):  
K. Iwasaki ◽  
N. Yamaguchi
1978 ◽  
Vol 84 (2) ◽  
pp. 191-205 ◽  
Author(s):  
Raymond Hill

AbstractThe packing problem for (k, 3)-caps is that of finding (m, 3)r, q, the largest size of (k, 3)-cap in the Galois space Sr, q. The problem is tackled by exploiting the interplay of finite geometries with error-correcting codes. An improved general upper bound on (m, 3)3 q and the actual value of (m, 3)3, 4 are obtained. In terms of coding theory, the methods make a useful contribution to the difficult task of establishing the existence or non-existence of linear codes with certain weight distributions.


Author(s):  
Mohammad Rizk Assaf ◽  
Abdel-Nasser Assimi

In this article, the authors investigate the enhanced two stage MMSE (TS-MMSE) equalizer in bit-interleaved coded FBMC/OQAM system which gives a tradeoff between complexity and performance, since error correcting codes limits error propagation, so this allows the equalizer to remove not only ICI but also ISI in the second stage. The proposed equalizer has shown less design complexity compared to the other MMSE equalizers. The obtained results show that the probability of error is improved where SNR gain reaches 2 dB measured at BER compared with ICI cancellation for different types of modulation schemes and ITU Vehicular B channel model. Some simulation results are provided to illustrate the effectiveness of the proposed equalizer.


2021 ◽  
pp. 1-11
Author(s):  
Kusan Biswas

In this paper, we propose a frequency domain data hiding method for the JPEG compressed images. The proposed method embeds data in the DCT coefficients of the selected 8 × 8 blocks. According to the theories of Human Visual Systems  (HVS), human vision is less sensitive to perturbation of pixel values in the uneven areas of the image. In this paper we propose a Singular Value Decomposition based image roughness measure (SVD-IRM) using which we select the coarse 8 × 8 blocks as data embedding destinations. Moreover, to make the embedded data more robust against re-compression attack and error due to transmission over noisy channels, we employ Turbo error correcting codes. The actual data embedding is done using a proposed variant of matrix encoding that is capable of embedding three bits by modifying only one bit in block of seven carrier features. We have carried out experiments to validate the performance and it is found that the proposed method achieves better payload capacity and visual quality and is more robust than some of the recent state-of-the-art methods proposed in the literature.


2021 ◽  
Vol 344 (2) ◽  
pp. 112199
Author(s):  
Christian Deppe ◽  
Vladimir Lebedev

Author(s):  
Varsha Chauhan ◽  
Anuradha Sharma ◽  
Sandeep Sharma ◽  
Monika Yadav

Sign in / Sign up

Export Citation Format

Share Document