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].展开更多
In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is hom...In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.展开更多
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.展开更多
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.展开更多
Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/...Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/(m,k_1)is odd,m/(m,k_2)is even.Define ap-ary linear code C_D =c(a_1,a_2):(a_1,a_2)∈F_q^2},where c(a_1,a_2)=(Tr(a_1x_1+a_2x_2))_((x1,x2)∈D).At most three-weight distributions of two classes of linear codes are settled.展开更多
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.展开更多
Improving power distribution characteristics of space time block codes(STBCs),namely peak to average power ratio(PAPR),average to minimum power ratio(Ave/min),and probability of transmitting"zero"by antenna,...Improving power distribution characteristics of space time block codes(STBCs),namely peak to average power ratio(PAPR),average to minimum power ratio(Ave/min),and probability of transmitting"zero"by antenna,makes easier their practical implementation.To this end,this study proposes to multiply full diversity STB C with a non-singular matrix in multiple input multiple output(MIMO)or multiple input single output(MISO)systems with linear or maximum likelihood(ML)receivers.It is proved that the obtained code achieves full diversity and the order of detection complexity does not change.The proposed method is applied to different types of STBCs.The bit error rate(BER)and power distribution characteristics of the new codes demonstrate the superiority of the introduced method.Further,lower and upper bounds on the BER of the obtained STBCs are derived for all receivers.The proposed method provides trade-off among PAPR,spectral efficiency,energy efficiency,and BER.展开更多
Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of...Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder.For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.展开更多
In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
基金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].
基金supported by Natural Science Foundation of China (No.61271258)
文摘In this work, the homomorphism of the classic linear block code in linear network coding for the case of binary field and its extensions is studied. It is proved that the classic linear error-control block code is homomorphic network error-control code in network coding. That is, if the source packets at the source node for a linear network coding are precoded using a linear block code, then every packet flowing in the network regarding to the source satisfies the same constraints as the source. As a consequence, error detection and correction can be performed at every intermediate nodes of multicast flow, rather than only at the destination node in the conventional way, which can help to identify and correct errors timely at the error-corrupted link and save the cost of forwarding error-corrupted data to the destination node when the intermediate nodes are ignorant of the errors. In addition, three examples are demonstrated which show that homomorphic linear code can be combined with homomorphic signature, McEliece public-key cryptosystem and unequal error protection respectively and thus have a great potential of practical utility.
基金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.
基金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.
文摘Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/(m,k_1)is odd,m/(m,k_2)is even.Define ap-ary linear code C_D =c(a_1,a_2):(a_1,a_2)∈F_q^2},where c(a_1,a_2)=(Tr(a_1x_1+a_2x_2))_((x1,x2)∈D).At most three-weight distributions of two classes of linear codes are settled.
基金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 Iran National Science Foundation(INSF)under grant number 93018647。
文摘Improving power distribution characteristics of space time block codes(STBCs),namely peak to average power ratio(PAPR),average to minimum power ratio(Ave/min),and probability of transmitting"zero"by antenna,makes easier their practical implementation.To this end,this study proposes to multiply full diversity STB C with a non-singular matrix in multiple input multiple output(MIMO)or multiple input single output(MISO)systems with linear or maximum likelihood(ML)receivers.It is proved that the obtained code achieves full diversity and the order of detection complexity does not change.The proposed method is applied to different types of STBCs.The bit error rate(BER)and power distribution characteristics of the new codes demonstrate the superiority of the introduced method.Further,lower and upper bounds on the BER of the obtained STBCs are derived for all receivers.The proposed method provides trade-off among PAPR,spectral efficiency,energy efficiency,and BER.
基金supported in part by National Nature Science Foundation of China under Grant No.61471286,No.61271004the Fundamental Research Funds for the Central Universitiesthe open research fund of Key Laboratory of Information Coding and Transmission,Southwest Jiaotong University(No.2010-03)
文摘Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder.For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.
基金supported in part by the National Science Foundation of China under Grant 11571005in part by the Key Research Project of Higher Education of the Education Department of Henan Province under Grant 19A120010
文摘In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
