In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low h...In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low hit zone LH （ or no hit zone NH ）, the maximum periodic Hamming autocorrelation sidelobe Ha and the maximum periodic Hamming crosscorrelation He, are established. It is shown that the new bounds include the known LempeI-Greenberger bounds, T.S. Seay bounds and Peng-Fan bounds for the conventional frequency hopping sequences as special cases.展开更多
An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was...An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step （RAS） was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm （QEA） and an individual＇s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.展开更多
In this paper,a property of Frequency Hopping (FH) sequence set with No Hit Zone (NHZ) is analyzed. Based on matrix transform and mapping methods,respectively,two classes of NHZ FH sequences are presented. These NHZ F...In this paper,a property of Frequency Hopping (FH) sequence set with No Hit Zone (NHZ) is analyzed. Based on matrix transform and mapping methods,respectively,two classes of NHZ FH sequences are presented. These NHZ FH sequences have good Hamming auto-correlation and Hamming cross-correlation properties. FH Code-Division Multiple Access (FH-CDMA) communication systems employing such NHZ FH sequences will eliminate multiple-access interference if the maximum time delay is shorter than the length of the NHZ.展开更多
When the number of runs is large, to search for uniform designs in the sense of low-discrepancy is an NP hard problem. The number of runs of most of the available uniform designs is small （≤50）. In this article, th...When the number of runs is large, to search for uniform designs in the sense of low-discrepancy is an NP hard problem. The number of runs of most of the available uniform designs is small （≤50）. In this article, the authors employ a kind of the so-called Hamming distance method to construct uniform designs with two- or three-level such that some resulting uniform designs have a large number of runs. Several infinite classes for the existence of uniform designs with the same Hamming distances between any distinct rows are also obtained simultaneously. Two measures of uniformity, the centered L2-discrepancy （CD, for short） and wrap-around L2-discrepancy （WD, for short）, are employed.展开更多
In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung n...In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this article.Adescription is provided of the scoring function,accuracy function and operational laws of the log q-rung VS.The algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming distance.Additionally,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify conceptualization.We chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile amnesia.Natural numbers q are used to express the results of the models.To demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.展开更多
Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose m...Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose maximum periodic Hamming correlation is 0 at the origin result in an LHZ FHS set based on the Cartesian product, and Proposition 4 presented an upper bound of the maximum periodic Hamming correlation of FHSs. However, their statements are imperfect or incorrect. In this paper, we give counterexamples and make corrections to them. Furthermore, based on the Cartesian product, we construct two classes of LHZ FHS sets with optimal maximum periodic partial Hamming correlation property. It is shown that new FHS sets are optimal by the maximum periodic partial Hamming correlation bound of LHZ FHS set.展开更多
A new approach to improve the test efficiency of random testing is presented in this paper. In conventional random testing, each test pattern is selected randomly regardless of the tests previously generated. This pap...A new approach to improve the test efficiency of random testing is presented in this paper. In conventional random testing, each test pattern is selected randomly regardless of the tests previously generated. This paper introduces the concept of random like testing. The method provided appears to have the same concepts as used in random testing,but actually takes an opposite way to it in order to improve the efficiency of random testing.In a random like testing sequence, the total distance among all test patterns is chosen to be maximal so that the fault sets detected by one test pattern are as different as possible from that detected by the tests previously applied. The procedure to construct a random like testing sequence (RLTS) is described in detail. Theorems to justify the effectiveness and usefulness of the procedure presented are developed. Experimental results on benchmark circuits as well as on other circuit are also given to evaluate the performance of the new approach.展开更多
In this paper,we propose the two-stage constructions for the rate-compatible shortened polar(RCSP)codes.For the Stage-I construction,the shortening pattern and the frozen bit are jointly designed to make the shortened...In this paper,we propose the two-stage constructions for the rate-compatible shortened polar(RCSP)codes.For the Stage-I construction,the shortening pattern and the frozen bit are jointly designed to make the shortened bits be completely known by the decoder.Besides,a distance-greedy algorithm is presented to improve the minimum Hamming distance of the codes.To design the remaining Stage-II frozen bits,three different construction algorithms are further presented,called the Reed-Muller(RM)construction,the Gaussian Approximation(GA)construction,and the RM-GA construction.Then we give the row weight distribution numerical results of the generator matrix after the Stage-I and Stage-II constructions,which shows that the proposed constructions can efficiently increase the minimum Hamming distance.Simulation results show that the proposed RCSP codes have excellent frame error rate(FER)performances at different code lengths and code rates.More specifically,the RM-GA construction performs best and can achieve at most 0.8 dB gain compared to the Wang14 and the quasi-uniform puncturing(QUP)schemes.The RM construction is designed completely by the distance-constraint without channel evaluation thus has the simplest structure.Interestingly,it still has better FER performance than the existing shortening/puncturing schemes,especially at high signal noise ratio(SNR)region.展开更多
Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly i...Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly independent array of length n over Vτ（F2）. The （n, t）-linearly independent array M that has the maximal number of elements is called the maximal （r, t）-linearly independent array, and the maximal number is denoted by M（r, t）. It is an interesting combinatorial structure, which has many applications in cryptography and coding theory. It can be used to construct orthogonal arrays, strong partial balanced designs. It can also be used to design good linear codes, In this paper, we construct a class of maximal （r, t）-linearly independent arrays of length r ＋ 2, and provide some enumerator theorems.展开更多
This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming dist...This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency. It exhibits a nice property--when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.展开更多
Recently, negative databases （NDBs） are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and...Recently, negative databases （NDBs） are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and so on. However, both classifying and clustering in negative databases have not yet been studied. Therefore, two algorithms, i.e., a k nearest neighbor （kNN） classification algorithm and a k-means clustering algorithm in NDBs, are proposed in this paper, respectively. The core of these two algorithms is a novel method for estimating the Hamming distance between a binary string and an NDB. Experimental results demonstrate that classifying and clustering in NDBs are promising.展开更多
基金This work was supported by the National Natural Science Foundation of China （Grant No. 60572142） the NSFC/RFBR Joint Research Scheme, the NSFC/K0SEF Joint Research Scheme, and IITA, South Korea.
文摘In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low hit zone LH （ or no hit zone NH ）, the maximum periodic Hamming autocorrelation sidelobe Ha and the maximum periodic Hamming crosscorrelation He, are established. It is shown that the new bounds include the known LempeI-Greenberger bounds, T.S. Seay bounds and Peng-Fan bounds for the conventional frequency hopping sequences as special cases.
基金supported by the National Natural Science Foundation of China (61473179)the Doctor Foundation of Shandong Province (BS2013DX032)the Youth Scholars Development Program of Shandong University of Technology (2014-09)
文摘An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step （RAS） was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm （QEA） and an individual＇s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.
基金the National Natural Science Foundation of China (No.90604035 and 60572142)the Program for New Century Excellent Talents in University (NCET) (No.NECT-05-0795).
文摘In this paper,a property of Frequency Hopping (FH) sequence set with No Hit Zone (NHZ) is analyzed. Based on matrix transform and mapping methods,respectively,two classes of NHZ FH sequences are presented. These NHZ FH sequences have good Hamming auto-correlation and Hamming cross-correlation properties. FH Code-Division Multiple Access (FH-CDMA) communication systems employing such NHZ FH sequences will eliminate multiple-access interference if the maximum time delay is shorter than the length of the NHZ.
基金This work was partially supported by the NNSF of China(10441001) the Project sponsored by SRF for ROCS (SEM) the NSF of Hubei Province. The second author's research was also partially supported by the Pre-studies Project of NBRP (2003CCA2400)
文摘When the number of runs is large, to search for uniform designs in the sense of low-discrepancy is an NP hard problem. The number of runs of most of the available uniform designs is small （≤50）. In this article, the authors employ a kind of the so-called Hamming distance method to construct uniform designs with two- or three-level such that some resulting uniform designs have a large number of runs. Several infinite classes for the existence of uniform designs with the same Hamming distances between any distinct rows are also obtained simultaneously. Two measures of uniformity, the centered L2-discrepancy （CD, for short） and wrap-around L2-discrepancy （WD, for short）, are employed.
基金supported by the National Research Foundation of Korea(NRF)Grant funded by the Korea government(MSIT)(No.RS-2023-00218176)Korea Institute for Advancement of Technology(KIAT)Grant funded by the Korea government(MOTIE)(P0012724)The Competency Development Program for Industry Specialist)and the Soonchunhyang University Research Fund.
文摘In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this article.Adescription is provided of the scoring function,accuracy function and operational laws of the log q-rung VS.The algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming distance.Additionally,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify conceptualization.We chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile amnesia.Natural numbers q are used to express the results of the models.To demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.
基金supported by National Natural Science Foundation of China(Grant No.61271244)Key Grant Project of Ministry of Education of China(Grant No.311031 100)Young Innovative Research Team of Sichuan Province(Grant No.2011JTD0007)
文摘Recently, Chung et al. gave a general method to construct frequency-hopping sequence set(FHS set) with low-hit-zone(LHZ FHS set) by the Cartesian product. In their paper, Theorems 5 and 8 claim that k FHS sets whose maximum periodic Hamming correlation is 0 at the origin result in an LHZ FHS set based on the Cartesian product, and Proposition 4 presented an upper bound of the maximum periodic Hamming correlation of FHSs. However, their statements are imperfect or incorrect. In this paper, we give counterexamples and make corrections to them. Furthermore, based on the Cartesian product, we construct two classes of LHZ FHS sets with optimal maximum periodic partial Hamming correlation property. It is shown that new FHS sets are optimal by the maximum periodic partial Hamming correlation bound of LHZ FHS set.
文摘A new approach to improve the test efficiency of random testing is presented in this paper. In conventional random testing, each test pattern is selected randomly regardless of the tests previously generated. This paper introduces the concept of random like testing. The method provided appears to have the same concepts as used in random testing,but actually takes an opposite way to it in order to improve the efficiency of random testing.In a random like testing sequence, the total distance among all test patterns is chosen to be maximal so that the fault sets detected by one test pattern are as different as possible from that detected by the tests previously applied. The procedure to construct a random like testing sequence (RLTS) is described in detail. Theorems to justify the effectiveness and usefulness of the procedure presented are developed. Experimental results on benchmark circuits as well as on other circuit are also given to evaluate the performance of the new approach.
基金This work was supported by the Interdisciplinary Scientific Research Foundation of GuangXi University(No.2022JCC015)the National Natural Science Foundation of China(Nos.61761006,61961004,and 61762011)the Natural Science Foundation of Guangxi of China(Nos.2017GXNSFAA198263 and 2018GXNSFAA2940。
文摘In this paper,we propose the two-stage constructions for the rate-compatible shortened polar(RCSP)codes.For the Stage-I construction,the shortening pattern and the frozen bit are jointly designed to make the shortened bits be completely known by the decoder.Besides,a distance-greedy algorithm is presented to improve the minimum Hamming distance of the codes.To design the remaining Stage-II frozen bits,three different construction algorithms are further presented,called the Reed-Muller(RM)construction,the Gaussian Approximation(GA)construction,and the RM-GA construction.Then we give the row weight distribution numerical results of the generator matrix after the Stage-I and Stage-II constructions,which shows that the proposed constructions can efficiently increase the minimum Hamming distance.Simulation results show that the proposed RCSP codes have excellent frame error rate(FER)performances at different code lengths and code rates.More specifically,the RM-GA construction performs best and can achieve at most 0.8 dB gain compared to the Wang14 and the quasi-uniform puncturing(QUP)schemes.The RM construction is designed completely by the distance-constraint without channel evaluation thus has the simplest structure.Interestingly,it still has better FER performance than the existing shortening/puncturing schemes,especially at high signal noise ratio(SNR)region.
基金Supported by National Natural Science Foundation of China (Grant Nos. 10771078, 60973138 and 10971246)Guangzhou Education Bureau Science Foundation (Grant No. 08C017)
文摘Let M be a subset of r-dimensional vector space Vτ （F2） over a finite field F2, consisting of n nonzero vectors, such that every t vectors of M are linearly independent over F2. Then M is called （n, t）-linearly independent array of length n over Vτ（F2）. The （n, t）-linearly independent array M that has the maximal number of elements is called the maximal （r, t）-linearly independent array, and the maximal number is denoted by M（r, t）. It is an interesting combinatorial structure, which has many applications in cryptography and coding theory. It can be used to construct orthogonal arrays, strong partial balanced designs. It can also be used to design good linear codes, In this paper, we construct a class of maximal （r, t）-linearly independent arrays of length r ＋ 2, and provide some enumerator theorems.
基金Supported by the National High-Technology Research and Development Program of China (863 Program)(2006AA01Z422)the National Natural Science Foundation of China(60672102)
文摘This paper develops a general hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables. The scheme addresses the weaknesses of existing key predistribution schemes, which have either worse security or lower efficiency. It exhibits a nice property--when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, we can trade off the resilience against node capture attack for higher probability of direct pairwise key establishment, so as to save the energy consumption which is the most important issue for sensor networks.
基金This work was partly supported by the National Natural Science Foundation of China （Grant＇No. 61175045）.
文摘Recently, negative databases （NDBs） are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and so on. However, both classifying and clustering in negative databases have not yet been studied. Therefore, two algorithms, i.e., a k nearest neighbor （kNN） classification algorithm and a k-means clustering algorithm in NDBs, are proposed in this paper, respectively. The core of these two algorithms is a novel method for estimating the Hamming distance between a binary string and an NDB. Experimental results demonstrate that classifying and clustering in NDBs are promising.
