In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differen...In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differences between bit patterns of two Gray codewords are analyzed in detail. On the basis of the properties, a method for encoding watermark bits in the Gray codewords that represent signal levels by a single-error-correcting (SEC) code is developed, which is referred to as the Gray-ECC method in this paper. The two codewords of the SEC code corresponding to respective watermark bits are determined so as to minimize the expected amount of distortion caused by the watermark embedding. The stochastic analyses show that an error-correcting capacity of the Gray-ECC method is superior to that of the ECC in natural binary codes for changes in signal codewords. Experiments of the Gray-ECC method were conducted on 8-bit monochrome images to evaluate both the features of watermarked images and the performance of robustness for image distortion resulting from the JPEG DCT-baseline coding scheme. The results demonstrate that, compared with a conventional averaging-based method, the Gray-ECC method yields watermarked images with less amount of signal distortion and also makes the watermark comparably robust for lossy data compression.展开更多
In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some ne...In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graphs. In addition, these constructed codes have the advantages of simple implementation and low-complexity encoding. Finally, the decoding approach for the proposed quantum QC LDPC is investigated.展开更多
In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit c...In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit can correct one-bit error, and the use of redundant bits to encode more than one-bit quantum information breaks the previous limitations of many bits encoding a quantum bit. Compared with the existing coding circuits （Shor code, Steane code and five stable subcode）, it shows obvious superiority in the quantum coding efficiency and transmission efficiency.展开更多
Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to im...Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.展开更多
Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition d...Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition degree can easily be adjusted simultaneously.This paper introduces a new type of pliable FR codes,called absolute balanced pliable FR(ABPFR)codes,in which the access balancing in DSS is considered.Additionally,the equivalence between pliable FR codes and resolvable transversal packings in combinatorial design theory is presented.Then constructions of pliable FR codes and ABPFR codes based on resolvable transversal packings are presented.展开更多
In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over ...In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).展开更多
Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into...Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.展开更多
Aiming at the problem that the bit error rate(BER)of asymmetrically clipped optical orthogonal frequency division multiplexing(ACO-OFDM)space optical communication system is significantly affected by different turbule...Aiming at the problem that the bit error rate(BER)of asymmetrically clipped optical orthogonal frequency division multiplexing(ACO-OFDM)space optical communication system is significantly affected by different turbulence intensities,the deep learning technique is proposed to the polarization code decoding in ACO-OFDM space optical communication system.Moreover,this system realizes the polarization code decoding and signal demodulation without frequency conduction with superior performance and robustness compared with the performance of traditional decoder.Simulations under different turbulence intensities as well as different mapping orders show that the convolutional neural network(CNN)decoder trained under weak-medium-strong turbulence atmospheric channels achieves a performance improvement of about 10^(2)compared to the conventional decoder at 4-quadrature amplitude modulation(4QAM),and the BERs for both 16QAM and 64QAM are in between those of the conventional decoder.展开更多
This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the propertie...This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the properties of Gray code. Two error-correction coding (ECC) schemes are used here: One scheme, referred to as the vertical ECC (VECC), is to encode information bits in a pixel by error-correction coding where the Gray code is used to improve the performance. The other scheme, referred to as the horizontal ECC (HECC), is to encode information bits in an image plane. In watermarking, HECC generates a codeword representing watermark bits, and each bit of the codeword is encoded by VECC. Simple single-error-correcting block codes are used in VECC and HECC. Several experiments of these schemes were conducted on test images. The result demonstrates that the error-correcting performance of HECC just depends on that of VECC, and accordingly, HECC enhances the capability of VECC. Consequently, HECC with appropriate codes can achieve stronger robustness to JPEG—caused distortions than non-channel-coding watermarking schemes.展开更多
This study introduces a lightweight deep learning model and a novel synthetic dataset designed to restore damaged one-dimensional(1D)barcodes and Quick Response(QR)codes,addressing critical challenges in logistics ope...This study introduces a lightweight deep learning model and a novel synthetic dataset designed to restore damaged one-dimensional(1D)barcodes and Quick Response(QR)codes,addressing critical challenges in logistics operations.The proposed solution leverages an efficient Pix2Pix-based framework,a type of conditional Generative Adversarial Network(GAN)optimized for image-to-image translation tasks,enabling the recovery of degraded barcodes and QR codes with minimal computational overhead.A core contribution of this work is the development of a synthetic dataset that simulates realistic damage scenarios frequently encountered in logistics environments,such as low contrast,misalignment,physical wear,and environmental interference.By training on this diverse and realistic dataset,the model demonstrates exceptional performance in restoring readability and decoding accuracy.The lightweight architecture,featuring a U-Net-based encoder-decoder with separable convolutions,ensures computational efficiency,making the approach suitable for real-time deployment on embedded and resource-constrained devices commonly used in logistics systems.Experimental results reveal significant improvements:QR code decoding ratios increased from 14%to 99%on training data and from 15%to 68%on validation data,while 1D barcode decoding ratios improved from 7%to 73%on training data and from 9%to 44%on validation data.By providing a robust,resource-efficient solution for restoring damaged barcodes and QR codes,this study offers practical advancements for enhancing the reliability of automated scanning systems in logistics operations,particularly under challenging conditions.展开更多
We construct an infinite family of minimal linear codes over the ring F_(2)+u F_(2).These codes are defined through trace functions and Boolean functions.Their Lee weight distribution is completely computed by Walsh t...We construct an infinite family of minimal linear codes over the ring F_(2)+u F_(2).These codes are defined through trace functions and Boolean functions.Their Lee weight distribution is completely computed by Walsh transformation.By Gray mapping,we obtain a family of minimal binary linear codes from a generic construction,which have prominent applications in secret sharing and secure two-party computation.展开更多
Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-med...Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length regime.However,this list decoding complexity becomes formidable as the decoding output list size increases.This is primarily incurred by the OSD.Addressing this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding paths.For the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword candidate.It is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code decoding.Moreover,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV codes.In particular,its integration with the improved OSD and BMA is discussed.Simulation results show that significant complexity reduction can be achieved.Consequently,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity.展开更多
This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and...This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and the corresponding non-binary replacement matrices are constructed by the progressive edge growth algorithm and randomly generated,respectively.The genetic algorithm is then utilized to optimize the base matrices and the replacement ones.The simulation results show that the NB-QC-LDPC codes constructed by the proposed method achieve better decoding performance and lower implementation complexity compared to the existing NB-LDPC codes such as consultative committee for space data system and Bei Dou satellite navigation system.展开更多
The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction perform...The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction performance of channel coding functions as a significant way of optimizing the transmission reliability and efficiency.In this paper,the efficient estimation methods of the block error rate(BLER)performance for rate-compatible polar codes(RCPC)are proposed under several scenarios.Firstly,the BLER performance of RCPC is generally evaluated in the additive white Gaussian noise channels.That is further extended into the Rayleigh fading channel case using an equivalent estimation method.Moreover,with respect to the powerful decoder such as successive cancellation list decoding,the performance estimation is derived analytically based on the polar weight spectrum and BLER upper bounds.Theoretical evaluation and numerical simulation results show that the estimated performance can fit well the practical simulated results of RCPC under the objective conditions,verifying the validity of our proposed performance estimation methods.Furthermore,the application designs of the reliability estimation of RCPC are explored,particularly in the advantages of the signal-to-noise(SNR)estimation and throughput efficiency optimization of polar coded hybrid automatic repeat request.展开更多
In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the s...In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.展开更多
The construction of polar codes in corre-lated block fading channels is still an open issue to be solved.In this paper,to explicitly reveal the impact of correlation on error performance of polar coded diver-sity comm...The construction of polar codes in corre-lated block fading channels is still an open issue to be solved.In this paper,to explicitly reveal the impact of correlation on error performance of polar coded diver-sity communication systems,an integrated framework has been established to analyze the theoretical error performance of polar codes in correlated block fading channels.First,the upper bound on error probabil-ity of polarized channels is derived based on split po-lar spectrum,which is fully determined by covariance channel matrix as well as the block-wise weight distri-bution of the corresponding polar subcode.Further,to facilitate practical implementations,we design a con-struction metric named polarized correlation weight(PCW)to generate polar codes in correlated block fad-ing channels.Finally,simulation results on block error rate indicate that the proposed metric can exhibit both diversity gain and coding gain compared to the con-ventional methods under successive cancellation de-coding.展开更多
In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the e...In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.展开更多
Digital content such as games,extended reality(XR),and movies has been widely and easily distributed over wireless networks.As a result,unauthorized access,copyright infringement by third parties or eavesdroppers,and ...Digital content such as games,extended reality(XR),and movies has been widely and easily distributed over wireless networks.As a result,unauthorized access,copyright infringement by third parties or eavesdroppers,and cyberattacks over these networks have become pressing concerns.Therefore,protecting copyrighted content and preventing illegal distribution in wireless communications has garnered significant attention.The Intelligent Reflecting Surface(IRS)is regarded as a promising technology for future wireless and mobile networks due to its ability to reconfigure the radio propagation environment.This study investigates the security performance of an uplink Non-Orthogonal Multiple Access(NOMA)system integrated with an IRS and employing Fountain Codes(FCs).Specifically,two users send signals to the base station at separate distances.A relay receives the signal from the nearby user first and then relays it to the base station.The IRS receives the signal from the distant user and reflects it to the relay,which then sends the reflected signal to the base station.Furthermore,a malevolent eavesdropper intercepts both user and relay communications.We construct mathematical equations for Outage Probability(OP),throughput,diversity evaluation,and Interception Probability(IP),offering quantitative insights to assess system security and performance.Additionally,OP and IP are analyzed using a Deep Neural Network(DNN)model.A deeper comprehension of the security performance of the IRS-assisted NOMA systemin signal transmission is provided by Monte Carlo simulations,which are also carried out to confirm the theoretical conclusions.展开更多
The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance ...The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance.展开更多
文摘In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differences between bit patterns of two Gray codewords are analyzed in detail. On the basis of the properties, a method for encoding watermark bits in the Gray codewords that represent signal levels by a single-error-correcting (SEC) code is developed, which is referred to as the Gray-ECC method in this paper. The two codewords of the SEC code corresponding to respective watermark bits are determined so as to minimize the expected amount of distortion caused by the watermark embedding. The stochastic analyses show that an error-correcting capacity of the Gray-ECC method is superior to that of the ECC in natural binary codes for changes in signal codewords. Experiments of the Gray-ECC method were conducted on 8-bit monochrome images to evaluate both the features of watermarked images and the performance of robustness for image distortion resulting from the JPEG DCT-baseline coding scheme. The results demonstrate that, compared with a conventional averaging-based method, the Gray-ECC method yields watermarked images with less amount of signal distortion and also makes the watermark comparably robust for lossy data compression.
基金Project supported by the National Natural Science Foundation of China (Grant Nos 60773085 and 60801051)the NSFC-KOSEF International Collaborative Research Funds (Grant Nos 60811140346 and F01-2008-000-10021-0)
文摘In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graphs. In addition, these constructed codes have the advantages of simple implementation and low-complexity encoding. Finally, the decoding approach for the proposed quantum QC LDPC is investigated.
基金Supported by the National Natural Science Foundation of China (61271122)the Natural Science Foundation of Anhui Province(1208085MF102)
文摘In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit can correct one-bit error, and the use of redundant bits to encode more than one-bit quantum information breaks the previous limitations of many bits encoding a quantum bit. Compared with the existing coding circuits （Shor code, Steane code and five stable subcode）, it shows obvious superiority in the quantum coding efficiency and transmission efficiency.
基金Project supported by the National Natural Science Foundation of China (Grant No. 61072071)
文摘Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
基金Supported in part by the National Key R&D Program of China(No.2020YFA0712300)NSFC(No.61872353)。
文摘Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition degree can easily be adjusted simultaneously.This paper introduces a new type of pliable FR codes,called absolute balanced pliable FR(ABPFR)codes,in which the access balancing in DSS is considered.Additionally,the equivalence between pliable FR codes and resolvable transversal packings in combinatorial design theory is presented.Then constructions of pliable FR codes and ABPFR codes based on resolvable transversal packings are presented.
基金Supported by Research Funds of Hubei Province(D20144401,Q20174503)。
文摘In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).
文摘Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.
基金supported by the National Natural Science Foundation of China(No.12104141).
文摘Aiming at the problem that the bit error rate(BER)of asymmetrically clipped optical orthogonal frequency division multiplexing(ACO-OFDM)space optical communication system is significantly affected by different turbulence intensities,the deep learning technique is proposed to the polarization code decoding in ACO-OFDM space optical communication system.Moreover,this system realizes the polarization code decoding and signal demodulation without frequency conduction with superior performance and robustness compared with the performance of traditional decoder.Simulations under different turbulence intensities as well as different mapping orders show that the convolutional neural network(CNN)decoder trained under weak-medium-strong turbulence atmospheric channels achieves a performance improvement of about 10^(2)compared to the conventional decoder at 4-quadrature amplitude modulation(4QAM),and the BERs for both 16QAM and 64QAM are in between those of the conventional decoder.
文摘This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the properties of Gray code. Two error-correction coding (ECC) schemes are used here: One scheme, referred to as the vertical ECC (VECC), is to encode information bits in a pixel by error-correction coding where the Gray code is used to improve the performance. The other scheme, referred to as the horizontal ECC (HECC), is to encode information bits in an image plane. In watermarking, HECC generates a codeword representing watermark bits, and each bit of the codeword is encoded by VECC. Simple single-error-correcting block codes are used in VECC and HECC. Several experiments of these schemes were conducted on test images. The result demonstrates that the error-correcting performance of HECC just depends on that of VECC, and accordingly, HECC enhances the capability of VECC. Consequently, HECC with appropriate codes can achieve stronger robustness to JPEG—caused distortions than non-channel-coding watermarking schemes.
基金supported by the Scientific and Technological Research Council of Turkey(TÜB˙ITAK)through the Industrial R&D Projects Grant Program(TEYDEB)under Project No.3211077(grant recipient:Metin Kahraman)。
文摘This study introduces a lightweight deep learning model and a novel synthetic dataset designed to restore damaged one-dimensional(1D)barcodes and Quick Response(QR)codes,addressing critical challenges in logistics operations.The proposed solution leverages an efficient Pix2Pix-based framework,a type of conditional Generative Adversarial Network(GAN)optimized for image-to-image translation tasks,enabling the recovery of degraded barcodes and QR codes with minimal computational overhead.A core contribution of this work is the development of a synthetic dataset that simulates realistic damage scenarios frequently encountered in logistics environments,such as low contrast,misalignment,physical wear,and environmental interference.By training on this diverse and realistic dataset,the model demonstrates exceptional performance in restoring readability and decoding accuracy.The lightweight architecture,featuring a U-Net-based encoder-decoder with separable convolutions,ensures computational efficiency,making the approach suitable for real-time deployment on embedded and resource-constrained devices commonly used in logistics systems.Experimental results reveal significant improvements:QR code decoding ratios increased from 14%to 99%on training data and from 15%to 68%on validation data,while 1D barcode decoding ratios improved from 7%to 73%on training data and from 9%to 44%on validation data.By providing a robust,resource-efficient solution for restoring damaged barcodes and QR codes,this study offers practical advancements for enhancing the reliability of automated scanning systems in logistics operations,particularly under challenging conditions.
基金National Natural Science Foundation of China(12201171)。
文摘We construct an infinite family of minimal linear codes over the ring F_(2)+u F_(2).These codes are defined through trace functions and Boolean functions.Their Lee weight distribution is completely computed by Walsh transformation.By Gray mapping,we obtain a family of minimal binary linear codes from a generic construction,which have prominent applications in secret sharing and secure two-party computation.
基金supported by the National Natural Science Foundation of China(NSFC)with project ID 62071498the Guangdong National Science Foundation(GDNSF)with project ID 2024A1515010213.
文摘Constituted by BCH component codes and its ordered statistics decoding(OSD),the successive cancellation list(SCL)decoding of U-UV structural codes can provide competent error-correction performance in the short-to-medium length regime.However,this list decoding complexity becomes formidable as the decoding output list size increases.This is primarily incurred by the OSD.Addressing this challenge,this paper proposes the low complexity SCL decoding through reducing the complexity of component code decoding,and pruning the redundant SCL decoding paths.For the former,an efficient skipping rule is introduced for the OSD so that the higher order decoding can be skipped when they are not possible to provide a more likely codeword candidate.It is further extended to the OSD variant,the box-andmatch algorithm(BMA),in facilitating the component code decoding.Moreover,through estimating the correlation distance lower bounds(CDLBs)of the component code decoding outputs,a path pruning(PP)-SCL decoding is proposed to further facilitate the decoding of U-UV codes.In particular,its integration with the improved OSD and BMA is discussed.Simulation results show that significant complexity reduction can be achieved.Consequently,the U-UV codes can outperform the cyclic redundancy check(CRC)-polar codes with a similar decoding complexity.
基金supported by the National Natural Science Foundation of China under Grants 62331002。
文摘This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and the corresponding non-binary replacement matrices are constructed by the progressive edge growth algorithm and randomly generated,respectively.The genetic algorithm is then utilized to optimize the base matrices and the replacement ones.The simulation results show that the NB-QC-LDPC codes constructed by the proposed method achieve better decoding performance and lower implementation complexity compared to the existing NB-LDPC codes such as consultative committee for space data system and Bei Dou satellite navigation system.
基金supported by National Natural Science Foundation of China(No.62201596)Research Planning Project of National University of Defense Technology(ZK22-45).
文摘The beyond fifth-generation Internet of Things requires more capable channel coding schemes to achieve high-reliability,low-complexity and lowlatency communications.The theoretical analysis of error-correction performance of channel coding functions as a significant way of optimizing the transmission reliability and efficiency.In this paper,the efficient estimation methods of the block error rate(BLER)performance for rate-compatible polar codes(RCPC)are proposed under several scenarios.Firstly,the BLER performance of RCPC is generally evaluated in the additive white Gaussian noise channels.That is further extended into the Rayleigh fading channel case using an equivalent estimation method.Moreover,with respect to the powerful decoder such as successive cancellation list decoding,the performance estimation is derived analytically based on the polar weight spectrum and BLER upper bounds.Theoretical evaluation and numerical simulation results show that the estimated performance can fit well the practical simulated results of RCPC under the objective conditions,verifying the validity of our proposed performance estimation methods.Furthermore,the application designs of the reliability estimation of RCPC are explored,particularly in the advantages of the signal-to-noise(SNR)estimation and throughput efficiency optimization of polar coded hybrid automatic repeat request.
基金the National Natural Science Foundation of China (Grant Nos. 61972413, 61901525, and 62002385)the National Key R&D Program of China (Grant No. 2021YFB3100100)RGC under Grant No. N HKUST619/17 from Hong Kong, China。
文摘In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.
基金supported by National Natural Science Foundation of China(No.62471054).
文摘The construction of polar codes in corre-lated block fading channels is still an open issue to be solved.In this paper,to explicitly reveal the impact of correlation on error performance of polar coded diver-sity communication systems,an integrated framework has been established to analyze the theoretical error performance of polar codes in correlated block fading channels.First,the upper bound on error probabil-ity of polarized channels is derived based on split po-lar spectrum,which is fully determined by covariance channel matrix as well as the block-wise weight distri-bution of the corresponding polar subcode.Further,to facilitate practical implementations,we design a con-struction metric named polarized correlation weight(PCW)to generate polar codes in correlated block fad-ing channels.Finally,simulation results on block error rate indicate that the proposed metric can exhibit both diversity gain and coding gain compared to the con-ventional methods under successive cancellation de-coding.
文摘In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.
基金supported in part by Vietnam National Foundation for Science and Technology Development(NAFOSTED)under Grant 102.04-2021.57in part by Culture,Sports and Tourism R&D Program through the Korea Creative Content Agency grant funded by the Ministry of Culture,Sports and Tourism in 2024(Project Name:Global Talent Training Program for Copyright Management Technology in Game Contents,Project Number:RS-2024-00396709,Contribution Rate:100%).
文摘Digital content such as games,extended reality(XR),and movies has been widely and easily distributed over wireless networks.As a result,unauthorized access,copyright infringement by third parties or eavesdroppers,and cyberattacks over these networks have become pressing concerns.Therefore,protecting copyrighted content and preventing illegal distribution in wireless communications has garnered significant attention.The Intelligent Reflecting Surface(IRS)is regarded as a promising technology for future wireless and mobile networks due to its ability to reconfigure the radio propagation environment.This study investigates the security performance of an uplink Non-Orthogonal Multiple Access(NOMA)system integrated with an IRS and employing Fountain Codes(FCs).Specifically,two users send signals to the base station at separate distances.A relay receives the signal from the nearby user first and then relays it to the base station.The IRS receives the signal from the distant user and reflects it to the relay,which then sends the reflected signal to the base station.Furthermore,a malevolent eavesdropper intercepts both user and relay communications.We construct mathematical equations for Outage Probability(OP),throughput,diversity evaluation,and Interception Probability(IP),offering quantitative insights to assess system security and performance.Additionally,OP and IP are analyzed using a Deep Neural Network(DNN)model.A deeper comprehension of the security performance of the IRS-assisted NOMA systemin signal transmission is provided by Monte Carlo simulations,which are also carried out to confirm the theoretical conclusions.
文摘The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance.
