The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr^l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r^(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we stud...The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr^l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r^(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we study self-dual codes over R_∞by means of self-dual codes over Ri,and give some characterizations of self-dual codes over R_∞.展开更多
In this paper, we discuss a kind of Hermitian inner product - symplectic inner product, which is different from the original inner product - Euclidean inner product. According to the definition of symplectic inner pro...In this paper, we discuss a kind of Hermitian inner product - symplectic inner product, which is different from the original inner product - Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.展开更多
A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L ...A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L were defined, which was the basis of self-dual codes defined on graphs and played a key role in the paper. The second were that a self-dual code could be defined on factor graph, which was much different from conventional algebraic method. The third was that a factor graph approach to judge a self-dual code was illustrated, which took advantage of duality properties of factor graphs and our proposed transform T_ R→L to offer a convenient and geometrically intuitive process to judge a self-dual code.展开更多
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.
In this paper, we construct MDS Euclidean self-dual codes which are ex-tended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized...In this paper, we construct MDS Euclidean self-dual codes which are ex-tended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes.展开更多
Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a prom...Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a promising solution due to their outstanding error-correction performance and low complexity.Unequal error protection(UEP)involves nonuniform error safeguarding for distinct data segments,achieving a fine balance between error resilience and resource allocation,which ultimately enhancing system performance and efficiency.In this paper,we propose a novel class of UEP rateless polar codes.The codes are designed based on matrix extension of polar codes,and elegant mapping and duplication operations are designed to achieve UEP property while preserving the overall performance of conventional polar codes.Superior UEP performance is attained without significant modifications to conventional polar codes,making it straightforward for compatibility with existing polar codes.A theoretical analysis is conducted on the block error rate and throughput efficiency performance.To the best of our knowledge,this work provides the first theoretical performance analysis of UEP rateless polar codes.Simulation results show that the proposed codes significantly outperform existing polar coding schemes in both block error rate and throughput efficiency.展开更多
Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successiv...Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successive cancellation(SC)decoding scheme based on the weighted levenshtein distance(WLD)of polar codes for correcting insertions/deletions in DPPM systems.In this method,the WLD is used to calculate the transfer probabilities recursively to obtain likelihood ratios,and the low-complexity SC decoding method is built according to the error characteristics to match the DPPM system.Additionally,the proposed SC decoding scheme is extended to list decoding,which can further improve error correction performance.Simulation results show that the proposed scheme can effectively correct insertions/deletions in the DPPM system,which enhances its reliability and performance.展开更多
Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively ...Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively high row weights,the existing blind recognition algorithms based on a candidate set generally perform worse.In this paper,we propose a blind recognition method for LDPC codes,called as tangent function assisted least square(TLS)method,which improves recognition performances by constructing a new cost function.To characterize the constraint degree among received vectors and paritycheck vectors,a feature function based on tangent function is constructed in the proposed algorithm.A cost function based on least square method is also established according to the feature function values satisfying the parity-check relationship.Moreover,the minimum average value in TLS is obtained on the candidate set.Numerical analysis and simulation results show that recognition performances of TLS algorithm are consistent with theoretical results.Compared with existing algorithms,the proposed method possesses better recognition performances.展开更多
In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power s...In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.展开更多
Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual perm...Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.展开更多
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.展开更多
Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also req...Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also require rate-matching.To this end,we first analyze the limitations of existing shortening patterns for PAC codes and explore their feasibility.Subsequently,we propose a novel shortening scheme for PAC codes based on list decoding,where the receiver is allowed to treat the values of the deleted bits as undetermined.This ap⁃proach uses a specialized PAC codeword and activates multiple decoding paths during the initialization of list decoding,enabling it to achieve the desired reliability.展开更多
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.展开更多
介绍了高温蠕变工况下运行的压力容器可能出现的失效模式,结合工程设计现状,指出了我国当前压力容器标准体系在确定高温蠕变工况许用压应力时存在的技术瓶颈,在此基础之上引出ASME Code Case 3029,对其适用范围、发展历程、产生背景及...介绍了高温蠕变工况下运行的压力容器可能出现的失效模式,结合工程设计现状,指出了我国当前压力容器标准体系在确定高温蠕变工况许用压应力时存在的技术瓶颈,在此基础之上引出ASME Code Case 3029,对其适用范围、发展历程、产生背景及工程意义进行了简单的介绍,以某工程设计项目中的实际结构为例,介绍了该方法的使用过程及注意事项,并结合压力容器工程设计领域的实际需求,对我国标准体系下一步的制定或修订方向提出了展望。展开更多
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.展开更多
基金Foundation item： Supported by the Scientific Research Foundation of Hubei Provincial Education Depart- ment（B2013069） Supported by the National Science Foundation of Hubei Polytechnic University（12xjzl4A, 11yjz37B）
文摘The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr^l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r^(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we study self-dual codes over R_∞by means of self-dual codes over Ri,and give some characterizations of self-dual codes over R_∞.
文摘In this paper, we discuss a kind of Hermitian inner product - symplectic inner product, which is different from the original inner product - Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.
基金The National Natural Science Foundation of China (No60472018)
文摘A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L were defined, which was the basis of self-dual codes defined on graphs and played a key role in the paper. The second were that a self-dual code could be defined on factor graph, which was much different from conventional algebraic method. The third was that a factor graph approach to judge a self-dual code was illustrated, which took advantage of duality properties of factor graphs and our proposed transform T_ R→L to offer a convenient and geometrically intuitive process to judge a self-dual code.
基金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.
文摘In this paper, we construct MDS Euclidean self-dual codes which are ex-tended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes.
基金supported by National Natural Science Foundation of China(No.62301008)China Postdoctoral Science Foundation(No.2022M720272)New Cornerstone Science Foundation through the XPLORER PRIZE。
文摘Mobile communications are reaching out to every aspect of our daily life,necessitating highefficiency data transmission and support for diverse data types and communication scenarios.Polar codes have emerged as a promising solution due to their outstanding error-correction performance and low complexity.Unequal error protection(UEP)involves nonuniform error safeguarding for distinct data segments,achieving a fine balance between error resilience and resource allocation,which ultimately enhancing system performance and efficiency.In this paper,we propose a novel class of UEP rateless polar codes.The codes are designed based on matrix extension of polar codes,and elegant mapping and duplication operations are designed to achieve UEP property while preserving the overall performance of conventional polar codes.Superior UEP performance is attained without significant modifications to conventional polar codes,making it straightforward for compatibility with existing polar codes.A theoretical analysis is conducted on the block error rate and throughput efficiency performance.To the best of our knowledge,this work provides the first theoretical performance analysis of UEP rateless polar codes.Simulation results show that the proposed codes significantly outperform existing polar coding schemes in both block error rate and throughput efficiency.
基金supported by National Natural Science Foundation of China(No.61801327).
文摘Differential pulse-position modulation(DP PM)can achieve a good compromise between power and bandwidth requirements.However,the output sequence has undetectable insertions and deletions.This paper proposes a successive cancellation(SC)decoding scheme based on the weighted levenshtein distance(WLD)of polar codes for correcting insertions/deletions in DPPM systems.In this method,the WLD is used to calculate the transfer probabilities recursively to obtain likelihood ratios,and the low-complexity SC decoding method is built according to the error characteristics to match the DPPM system.Additionally,the proposed SC decoding scheme is extended to list decoding,which can further improve error correction performance.Simulation results show that the proposed scheme can effectively correct insertions/deletions in the DPPM system,which enhances its reliability and performance.
基金Fundamental Research Funds for the Central Universities under Grant 3072025YC0802the National Natural Science Foundation of China under Grant 62001138Heilongjiang Provincial Natural Science Foundation of China under Grant LH2021F009。
文摘Blind recognition of low-density paritycheck(LDPC)codes has gradually attracted more attention with the development of military and civil communications.However,in the case of the paritycheck matrices with relatively high row weights,the existing blind recognition algorithms based on a candidate set generally perform worse.In this paper,we propose a blind recognition method for LDPC codes,called as tangent function assisted least square(TLS)method,which improves recognition performances by constructing a new cost function.To characterize the constraint degree among received vectors and paritycheck vectors,a feature function based on tangent function is constructed in the proposed algorithm.A cost function based on least square method is also established according to the feature function values satisfying the parity-check relationship.Moreover,the minimum average value in TLS is obtained on the candidate set.Numerical analysis and simulation results show that recognition performances of TLS algorithm are consistent with theoretical results.Compared with existing algorithms,the proposed method possesses better recognition performances.
文摘In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.
基金Supported by the National Natural Science Foundation of China (60373087, 60473023, 90104005, 60673071)
文摘Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.
基金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 in part by the National Natural Sciences Foun⁃dation of China(NSFC)under Grant Nos.62301185 and 62027802in part by ZTE Industry⁃University-Institute Cooperation Fundsin part by The Major Key Project of PCL under Grant No.PCL2024A01.
文摘Shortening is a standard rate-matching method for polar codes in wireless communications.Since polarization-adjusted convolu⁃tional(PAC)codes also have a block length limited to the integer powers of two,they also require rate-matching.To this end,we first analyze the limitations of existing shortening patterns for PAC codes and explore their feasibility.Subsequently,we propose a novel shortening scheme for PAC codes based on list decoding,where the receiver is allowed to treat the values of the deleted bits as undetermined.This ap⁃proach uses a specialized PAC codeword and activates multiple decoding paths during the initialization of list decoding,enabling it to achieve the desired reliability.
基金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.
文摘介绍了高温蠕变工况下运行的压力容器可能出现的失效模式,结合工程设计现状,指出了我国当前压力容器标准体系在确定高温蠕变工况许用压应力时存在的技术瓶颈,在此基础之上引出ASME Code Case 3029,对其适用范围、发展历程、产生背景及工程意义进行了简单的介绍,以某工程设计项目中的实际结构为例,介绍了该方法的使用过程及注意事项,并结合压力容器工程设计领域的实际需求,对我国标准体系下一步的制定或修订方向提出了展望。
基金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.
