In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenar...In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.展开更多
Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil s...Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].展开更多
Aiming at the local intensity anamorphosis in general linearly coded profilometry, the post treatment methods under different decoding conditions are proposed, in which the distorted intensities are rehabilitated or e...Aiming at the local intensity anamorphosis in general linearly coded profilometry, the post treatment methods under different decoding conditions are proposed, in which the distorted intensities are rehabilitated or eliminated by our routines. The experimental results show that the measuring error and system cost can be effectively reduced while the reliability can be improved by introducing those methods into decoding process.展开更多
Linear dispersion codes (LDCs) were originally designed based on maximum likelihood detection. They do not have good performance when using ordered successive interference cancellation (OSIC) detection. In this paper,...Linear dispersion codes (LDCs) were originally designed based on maximum likelihood detection. They do not have good performance when using ordered successive interference cancellation (OSIC) detection. In this paper,we propose a new improved linear dispersion codes transmission scheme to combat performance loss of original LDCs when using OSIC detection. We introduce an interleaver to each data substream transmitted over different antennas after LDCs encoder. Furthermore,a new computer search criterion for a linear transformation matrix is also proposed. New search criterion is to minimize the symbol error rate based on OSIC detection. Computer simulations show that the performance of proposed LDCs transmission scheme is better than the original LDCs.展开更多
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block co...This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.展开更多
Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding proc...Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.展开更多
m-weight, as a new generalization of classical Hamming weight, was discussedin this paper. A condition for the existence of linear codes of certain m-weights was given; theSingleton bound, Plotkin bound and Sphere Par...m-weight, as a new generalization of classical Hamming weight, was discussedin this paper. A condition for the existence of linear codes of certain m-weights was given; theSingleton bound, Plotkin bound and Sphere Parking bound of Hamming weight were correspondinglygeneralized to the m-weight.展开更多
A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify h...A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.展开更多
The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matr...The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.展开更多
We know that for a code C,it‘s very important to find out the Automorphism groupAutC of C.However,it is very difficult to seek entire AutC.In this paper,using the G.I of matrices over a finite field,we give several m...We know that for a code C,it‘s very important to find out the Automorphism groupAutC of C.However,it is very difficult to seek entire AutC.In this paper,using the G.I of matrices over a finite field,we give several methods to judge whether a permutation σ∈S_n.(Symmetric group) belongs to AutC or not.They are helpful for the purpose to ex-展开更多
Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes th...Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery Networks(CDN)or Information-Centric Networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into consideration.An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly.With the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.展开更多
A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC...A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.展开更多
The cooperative diversity schemes can effectively create a virtual antenna array for path fading combating multiin wireless channels. However, a lot of cooperative diversity schemes require perfect synchronization whi...The cooperative diversity schemes can effectively create a virtual antenna array for path fading combating multiin wireless channels. However, a lot of cooperative diversity schemes require perfect synchronization which is, in practice, difficult and even impossible to be realized. In this paper, we propose an asynchronous cooperative diversity scheme based on the linear dispersion code （LDC）. By adding the zero padding （ZP） between linear dispersion codewords, our scheme mitigates the effect of asynchronism effectively. The length of ZP is decided by relative timing errors between different relays. Besides, an easy decoding method of our scheme is given in this paper by restructuring the stacked channel matrix.展开更多
Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, ...Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.展开更多
Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every lin...Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.展开更多
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved i...The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.展开更多
We study the structure of cyclic codes of an arbitrary length n over the ring F2+ uF2+ vF2, which is not a finite chain ring. We prove that the Gray image of a cyclic code length n over F2+ uF2+ vF2 is a 3-quasi-cycli...We study the structure of cyclic codes of an arbitrary length n over the ring F2+ uF2+ vF2, which is not a finite chain ring. We prove that the Gray image of a cyclic code length n over F2+ uF2+ vF2 is a 3-quasi-cyclic code length 3n over F2.展开更多
This article proposes a novel nonlinear network code in the GF（2^m） finite field. Different from previous linear network codes that linearly mix multiple input flows, the proposed nonlinear network code mixes input ...This article proposes a novel nonlinear network code in the GF（2^m） finite field. Different from previous linear network codes that linearly mix multiple input flows, the proposed nonlinear network code mixes input flows through both multiplication and exponentiation in the GF（2^m）. Three relevant rules for selecting discussed, and the relationship between the power parameter m proper parameters for the proposed nonlinear network code are and the coding coefficient K is explored. Further analysis shows that the proposed nonlinear network code is equivalent to a linear network code with deterministic coefficients.展开更多
In recent years, the accuracy of speech recognition (SR) has been one of the most active areas of research. Despite that SR systems are working reasonably well in quiet conditions, they still suffer severe performance...In recent years, the accuracy of speech recognition (SR) has been one of the most active areas of research. Despite that SR systems are working reasonably well in quiet conditions, they still suffer severe performance degradation in noisy conditions or distorted channels. It is necessary to search for more robust feature extraction methods to gain better performance in adverse conditions. This paper investigates the performance of conventional and new hybrid speech feature extraction algorithms of Mel Frequency Cepstrum Coefficient (MFCC), Linear Prediction Coding Coefficient (LPCC), perceptual linear production (PLP), and RASTA-PLP in noisy conditions through using multivariate Hidden Markov Model (HMM) classifier. The behavior of the proposal system is evaluated using TIDIGIT human voice dataset corpora, recorded from 208 different adult speakers in both training and testing process. The theoretical basis for speech processing and classifier procedures were presented, and the recognition results were obtained based on word recognition rate.展开更多
Visible light(VL)plays an important role in achieving high-precision positioning and low bit error radio(BER)data communication.However,most VL-based systems can not achieve positioning and communication,simultaneousl...Visible light(VL)plays an important role in achieving high-precision positioning and low bit error radio(BER)data communication.However,most VL-based systems can not achieve positioning and communication,simultaneously.There are two problems:1)the hybrid systems are difficult to extract distinguishable positioning beacon features without affecting communication performance,2)in the hybrid systems,the lost data bits in the inter-frame gap(IFG)are hard to recover,which affects positioning and communication performance.Therefore,in this article,we propose a novel VL-based hybrid positioning and communication system,named HY-PC system,to solve the above problems.First,we propose the robust T-W mapping for recognizing specific Light Emitting Diodes(LEDs),which can provide stable LED recognition accuracy without adding extra beacon data and does not decrease the communication rate.Furthermore,we also propose the novel linear block coding and bit interleaving mechanism,which can recover the lost data bits in the IFG and improve data communication performance.Finally,we use commercial off-the-shelf devices to implement our HY-PC system,extensive experimental results show that our HY-PC system can achieve consistent high-precision positioning and low-BER data communication,simultaneously.展开更多
基金This work was supported in part by the Guangdong Basic and Applied Basic Research Foundation under Key Project 2019B1515120032in part by the National Science Foundation of China(NSFC)with grant no.61901534+3 种基金in part by the Science,Technology and Innovation Commission of Shenzhen Municipality with grant no.JCYJ20190807155617099in part by the University Basic Research Fund 20lgpy43in part by the Guangdong Natural Science Foundation of Grant No.2019A1515011622the Foundation of Grant No.2019-JCJQ-JJ-411.
文摘In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.
基金supported by the Natural Science Foundation of China (No.11901062)the Sichuan Natural Science Foundation (No.2024NSFSC0417)。
文摘Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].
文摘Aiming at the local intensity anamorphosis in general linearly coded profilometry, the post treatment methods under different decoding conditions are proposed, in which the distorted intensities are rehabilitated or eliminated by our routines. The experimental results show that the measuring error and system cost can be effectively reduced while the reliability can be improved by introducing those methods into decoding process.
文摘Linear dispersion codes (LDCs) were originally designed based on maximum likelihood detection. They do not have good performance when using ordered successive interference cancellation (OSIC) detection. In this paper,we propose a new improved linear dispersion codes transmission scheme to combat performance loss of original LDCs when using OSIC detection. We introduce an interleaver to each data substream transmitted over different antennas after LDCs encoder. Furthermore,a new computer search criterion for a linear transformation matrix is also proposed. New search criterion is to minimize the symbol error rate based on OSIC detection. Computer simulations show that the performance of proposed LDCs transmission scheme is better than the original LDCs.
基金supported by the National Natural Science Foundation of China(61171170) the Natural Science Foundation of Anhui Province(1408085QF115)
文摘This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
基金She was with the Department of Mathematics in Wuhan University while writting this paper.
文摘Abraham Lempel et al made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.
文摘m-weight, as a new generalization of classical Hamming weight, was discussedin this paper. A condition for the existence of linear codes of certain m-weights was given; theSingleton bound, Plotkin bound and Sphere Parking bound of Hamming weight were correspondinglygeneralized to the m-weight.
文摘A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.
文摘The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.
文摘We know that for a code C,it‘s very important to find out the Automorphism groupAutC of C.However,it is very difficult to seek entire AutC.In this paper,using the G.I of matrices over a finite field,we give several methods to judge whether a permutation σ∈S_n.(Symmetric group) belongs to AutC or not.They are helpful for the purpose to ex-
文摘Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery Networks(CDN)or Information-Centric Networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into consideration.An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly.With the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.
基金Sponsored by the "111" Project of China (B08038)Important National Science & Technology Specific Projects (2009ZX03003-003+2 种基金2009ZX03003-004) the NSFC-Guangdong (U0635003)Program for Changjiang Scholars and Innovative Research Team in University(IRT0852)
文摘A new architecture of space-time codes as a combination of orthogonal space-time block codes （OSTBC） and linear dispersion codes （LDC） is proposed in order to improve the bit error rate（BER） performance of OSTBC.The scheme proposed is named linear dispersion orthogonal space-time block codes （LDOSTBC）.In LDOSTBC scheme,firstly,the data is coded into LDC codewords.Then,the coded LDC substreams are coded into OSTBC codewords again.The decoding algorithm of LDOSTBC combines linear decoding of OSTBC and ML decoding or suboptimum detection algorithms of LDC.Compared with OSTBC scheme when the rate of LDC is MtR,the performance of LDOSTBC scheme can be improved without decreasing the data rate,where Mt is the number of transmit antennas and R is the spectral efficiency of the modulation constellation.If some rate penalty is allowed,when the rate of LDC is less than MtR the performance of LDOSTBC can be improved further.
基金Supported by the National High Technology Research and Development Program of China （ No. 2006AA01Z270）, the Programane of Introducing Talents of Discipline to University of China （No. B08038） and the Joint Funds of National Natural Science Foundation of China-Guangdong Province （No. U0635003）.
文摘The cooperative diversity schemes can effectively create a virtual antenna array for path fading combating multiin wireless channels. However, a lot of cooperative diversity schemes require perfect synchronization which is, in practice, difficult and even impossible to be realized. In this paper, we propose an asynchronous cooperative diversity scheme based on the linear dispersion code （LDC）. By adding the zero padding （ZP） between linear dispersion codewords, our scheme mitigates the effect of asynchronism effectively. The length of ZP is decided by relative timing errors between different relays. Besides, an easy decoding method of our scheme is given in this paper by restructuring the stacked channel matrix.
文摘Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.
文摘Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.
文摘The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.
基金Foundation item： Supported by the Scientific Research Foundation of Education Department of Hubei Province（B2013069） Supported by the National Science Foundation of Hubei Polytechnic University of China （12xjzl4A, llyjz37B）
文摘We study the structure of cyclic codes of an arbitrary length n over the ring F2+ uF2+ vF2, which is not a finite chain ring. We prove that the Gray image of a cyclic code length n over F2+ uF2+ vF2 is a 3-quasi-cyclic code length 3n over F2.
基金supported by Xilinx University Program(XUP),Xilinx(China)Ltd,the National Natural Science Foundation of China(60572066)
文摘This article proposes a novel nonlinear network code in the GF（2^m） finite field. Different from previous linear network codes that linearly mix multiple input flows, the proposed nonlinear network code mixes input flows through both multiplication and exponentiation in the GF（2^m）. Three relevant rules for selecting discussed, and the relationship between the power parameter m proper parameters for the proposed nonlinear network code are and the coding coefficient K is explored. Further analysis shows that the proposed nonlinear network code is equivalent to a linear network code with deterministic coefficients.
文摘In recent years, the accuracy of speech recognition (SR) has been one of the most active areas of research. Despite that SR systems are working reasonably well in quiet conditions, they still suffer severe performance degradation in noisy conditions or distorted channels. It is necessary to search for more robust feature extraction methods to gain better performance in adverse conditions. This paper investigates the performance of conventional and new hybrid speech feature extraction algorithms of Mel Frequency Cepstrum Coefficient (MFCC), Linear Prediction Coding Coefficient (LPCC), perceptual linear production (PLP), and RASTA-PLP in noisy conditions through using multivariate Hidden Markov Model (HMM) classifier. The behavior of the proposal system is evaluated using TIDIGIT human voice dataset corpora, recorded from 208 different adult speakers in both training and testing process. The theoretical basis for speech processing and classifier procedures were presented, and the recognition results were obtained based on word recognition rate.
基金supported by the Guangdong Basic and Applied Basic Research Foundation No.2021A1515110958National Natural Science Foundation of China No.62202215+2 种基金SYLU introduced high-level talents scientific research support planChongqing University Innovation Research Group(CXQT21019)Chongqing Talents Project(CQYC201903048)。
文摘Visible light(VL)plays an important role in achieving high-precision positioning and low bit error radio(BER)data communication.However,most VL-based systems can not achieve positioning and communication,simultaneously.There are two problems:1)the hybrid systems are difficult to extract distinguishable positioning beacon features without affecting communication performance,2)in the hybrid systems,the lost data bits in the inter-frame gap(IFG)are hard to recover,which affects positioning and communication performance.Therefore,in this article,we propose a novel VL-based hybrid positioning and communication system,named HY-PC system,to solve the above problems.First,we propose the robust T-W mapping for recognizing specific Light Emitting Diodes(LEDs),which can provide stable LED recognition accuracy without adding extra beacon data and does not decrease the communication rate.Furthermore,we also propose the novel linear block coding and bit interleaving mechanism,which can recover the lost data bits in the IFG and improve data communication performance.Finally,we use commercial off-the-shelf devices to implement our HY-PC system,extensive experimental results show that our HY-PC system can achieve consistent high-precision positioning and low-BER data communication,simultaneously.
