期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到59,894篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Finite Geometry and Deep Holes of Reed-Solomon Codes over Finite Local Rings 认领 引用 被引量：1
1
作者 Jun Zhang Haiyan Zhou 《Communications in Mathematical Research》 CSCD 2022年第2期206-222,共17页
In this paper, we first propose the maximum arc problem, normal rational curve conjecture, and extensions of normal rational curves over finite local rings, analogously to the finite geometry over finite fields. We th... In this paper, we first propose the maximum arc problem, normal rational curve conjecture, and extensions of normal rational curves over finite local rings, analogously to the finite geometry over finite fields. We then study the deep hole problem of generalized Reed-Solomon (RS) codes over finite local rings. Several different classes of deep holes are constructed. The relationship between finite geometry and deep holes of RS codes over finite local rings are also studied. 展开更多
关键词 Finite geometry finite local ring Reed-Solomon code covering radius deep hole
On Deep Holes of Projective Reed-Solomon Codes over Finite Fields with Even Characteristic 认领 引用
2
作者 XU Xiaofan 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2023年第1期15-19,共5页
Projective Reed-Solomon code is an important class of maximal distance separable codes in reliable communication and deep holes play important roles in its decoding.In this paper,we obtain two classes of deep holes of... Projective Reed-Solomon code is an important class of maximal distance separable codes in reliable communication and deep holes play important roles in its decoding.In this paper,we obtain two classes of deep holes of projective Reed-Solomon codes over finite fields with even characteristic.That is,let Fq be finite field with even characteristic,k∈{2,q-2},and let u(x)be the Lagrange interpolation polynomial of the first q components of the received vector u∈Fq+1 q Suppose that the(q+1)-th component of u is 0,and u(x)=λxk+f≤k-2(x),λxq-2+f≤k-2(x),where λ∈F*q and f≤k-2(x)is a polynomial over Fq with degree no more than k-2.Then the received vector u is a deep hole of projective Reed-Solomon codes PRS(Fq,k).In fact,our result partially solved an open problem on deep holes of projective Reed-Solomon codes proposed by Wan in 2020. 展开更多
关键词 finite field even characteristic projective Reed-Solomon code deep hole
暂未订购 下载PDF
FAST ALGORITHM FOR REED-SOLOMON CODE AND THE HARDWARE IMPLEMENTATION 认领 引用
3
作者 张毓忠 滕建辅 周长华 《Transactions of Tianjin University》 CAS 1995年第1期83+80-83,共84页
This paper described a signal processor for the Reed-Solomon (R-S) code using micro-programming. For the purpose of fast encoding and decoding,a formula for detecting two errors is derived, and the Qian search method ... This paper described a signal processor for the Reed-Solomon (R-S) code using micro-programming. For the purpose of fast encoding and decoding,a formula for detecting two errors is derived, and the Qian search method for the decoding process is improved. The number of searches is significantly reduced from 256 to 4. At the same time, the circuit is simplified and the speed is increased. For the convenience of programming, a micro-programming compiling package is developed. The package can be used for programming of different formats of R-S code signal processors of DAB, MD and DCC. The software and the hardware can be used for error correcting, error detecting and error compensation of different formats of R-S code. 展开更多
关键词 R-S code encoding decoding Qian search
暂未订购 下载PDF
Study on the aided PC-ASCL decoding algorithm based on optimized parity check codes 认领 引用
4
作者 Jianguo YUAN Deyi YANG +1 位作者 Ziliang ZHU Jinneng XIANG 《Optoelectronics Letters》 EI 2026年第2期87-91,共5页
Aiming at the poor performance of the parity check(PC) aided adaptive successive cancellation list(PC-ASCL) decoding algorithm because the PC code in the polar code can only verify odd errors, an optimized parity chec... Aiming at the poor performance of the parity check(PC) aided adaptive successive cancellation list(PC-ASCL) decoding algorithm because the PC code in the polar code can only verify odd errors, an optimized parity check(OPC) code which can verify all odd errors as well as the half even errors is proposed. The OPC code is used to improve the PC-ASCL decoding algorithm, thus an OPC aided ASCL(OPC-ASCL) decoding algorithm is proposed. In the coding stage, the algorithm divides the information sequence into multiple segments, and places an OPC code at the end of each segment to verify the current information sequence, and places a cyclic redundancy check code at the end of the entire information sequence to verify the entire information sequence. In the decoding stage, the algorithm uses the OPC-ASCL decoder to decode. Simulation results show that compared to the PC-ASCL decoding algorithm, the OPC-ASCL decoding algorithm can reduce the complexity and obtain the certain performance gain. 展开更多
关键词 pc ascl decoding pc code adaptive successive cancellation list pc ascl divides information sequence multip parity check polar code optimized parity check coding stage
暂未订购 下载PDF
Quantum toric code decoding method based on syndrome-preliminary error fusion module and ResNet architecture 认领 引用
5
作者 Nai-Hua Ji Ping-Li Song +2 位作者 Wei Wang Hui-Qian Sun Hong-Yang Ma 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第6期649-659,共11页
Quantum error correction technology is based on the principle of redundant encoding,encoding logical quantum information into multiple physical qubits to provide important support for the stable operation of quantum c... Quantum error correction technology is based on the principle of redundant encoding,encoding logical quantum information into multiple physical qubits to provide important support for the stable operation of quantum computers.To address the issues of low decoding accuracy and limited feature extraction in quantum error correction,this paper proposes a toric code decoder based on a syndrome-preliminary error fusion module(SPEFM)and a ResNet architecture.This decoder takes full advantage of the correlations between X and Z errors.In the SPEFM,the syndrome and preliminary error predictions are deeply fused,while a unidirectional Swin transformer architecture is incorporated to extract global error features from the syndrome data,signiffiificantly improving both decoding accuracy and computational efffiificiency.In addition,this paper further extracts local error features from the fused features using the deep residual structure of ResNet,enhancing the decoder's ability to capture quantum error patterns.Experimental results show that the decoder is applicable to different code distances(d=4,6,8,10)under the depolarizing noise model.Its bit error rate is lower than that of the minimum weight perfect matching(MWPM)algorithm,and its logical error rate is lower than both the MWPM algorithm and the ResNet18 decoder.Furthermore,the decoding threshold is increased to 0.163,representing a 3.82%improvement over the MWPM algorithm threshold of 0.157. 展开更多
关键词 quantum error correction toric code ResNet Swin transformer
暂未订购 下载PDF
On Reed-Solomon Codes 认领 引用 被引量：7
6
作者 Qunying LIAO 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2011年第1期89-98,共10页
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory.The main problem is to compute the error distance of a received word.Using the Weil bound for character sum estim... The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory.The main problem is to compute the error distance of a received word.Using the Weil bound for character sum estimate,Li and Wan showed that the error distance can be determined when the degree of the received word as a polynomial is small.In the first part,the result of Li and Wan is improved.On the other hand,one of the important parameters of an error-correcting code is the dimension.In most cases,one can only get bounds for the dimension.In the second part,a formula for the dimension of the generalized trace Reed-Solomon codes in some cases is obtained. 展开更多
关键词 Reed-Solomon code Weil bound Error distance Rational function Trace Reed-Solomon code Trace map
暂未订购 下载PDF
Improving MCUCN code to simulate ultracold neutron storage and transportation in superfluid4He 认领 引用
7
作者 Xue-Fen Han Fei Shen +6 位作者 Bin Zhou Xiao-Xiao Cai Tian-Cheng Yi Zhi-Liang Hu Song-Lin Wang Tian-Jiao Liang Robert Golub 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2026年第3期235-246,共12页
The ultracold neutron(UCN)transport code,MCUCN,designed initially for simulating UCN transportation from a solid deuterium(SD_2)source and neutron electric dipole moment experiments,could not simulate UCN storage and ... The ultracold neutron(UCN)transport code,MCUCN,designed initially for simulating UCN transportation from a solid deuterium(SD_2)source and neutron electric dipole moment experiments,could not simulate UCN storage and transportation in a superfluid4He(SFHe,He-Ⅱ)source accurately.This limitation arose from the absence of an4He upscattering mechanism and the absorption of3He.And the provided source energy distribution in MCUCN is different from that in SFHe source.This study introduced enhancements to MCUCN to address these constraints,explicitly incorporating the4He upscattering effect,the absorption of3He,the loss caused by impurities on converter wall,UCN source energy distribution in SFHe,and the transmission through negative optical potential.Additionally,a Python-based visualization code for intermediate states and results was developed.To validate these enhancements,we systematically compared the simulation results of the Lujan Center Mark3 UCN system by MCUCN and the improved MCUCN code(iMCUCN)with UCNtransport simulations.Additionally,we compared the results of the SUN1 system simulated by MCUCN and iMCUCN with measurement results.The study demonstrates that iMCUCN effectively simulates the storage and transportation of ultracold neutrons in He-Ⅱ. 展开更多
关键词 Ultracold neutron Storage Transportation Improved MCUCN code Upscattering effect Absorption by3He
暂未订购 下载PDF
Reliability-Based Code Calibration of Pultruded Glass Fibre-Reinforced Polymer I-Section Beams Under End-Two-Flange and Interior-Two-Flange Web-Crippling Loading Cases 认领 引用
8
作者 Andre Dias Martins Ângelo Palos Teixeira +1 位作者 Nuno Silvestre João Ramôa Correia 《Engineering》 SCIE EI CSCD 2026年第6期211-230,共20页
This paper presents a reliability-based code calibration procedure aimed at determining optimal partial safety factors to be employed in design rules for pultruded glass fibre-reinforced polymer(pGFRP)I-section beams,... This paper presents a reliability-based code calibration procedure aimed at determining optimal partial safety factors to be employed in design rules for pultruded glass fibre-reinforced polymer(pGFRP)I-section beams,susceptible to web-crippling,namely under end-two-flange(ETF)and interior-two-flange(ITF)loading cases with unfastened flanges.Following a comprehensive state-of-the-art literature overview regarding web-crippling of pGFRP beams,the description of a direct strength method(DSM)-based resistance model for the two web-crippling loading cases is presented.Next,attention is turned to the detailed description of the(structural)reliability-based code calibration procedure for both loading cases.This includes detailing all the necessary steps and pertinent data,encompassing the adopted probabilistic models for material prop-erties,loads,geometrical dimensions,and resistance model uncertainty.Then,the results obtained through the application of the code calibration procedure are presented,validated,and discussed.Lastly,the paper closes by presenting relevant concluding remarks,which include recommendations for the partial safety fac-tors to be applied in the resistance model for pGFRP I-beams under ETF and ITF loading cases. 展开更多
关键词 Pultruded glass fibre-reinforced polymers Web-crippling End-two-flange Interior-two-flange Structural safety Reliability-based code calibration Partial safety factors
暂未订购 下载PDF
Cognitive Erasure-Coded Data Update and Repair for Mitigating I/O Overhead 认领 引用
9
作者 Bing Wei Ming Zhong +2 位作者 Qian Chen Yi Wu Yubin Li 《Computers, Materials & Continua》 SCIE EI 2026年第2期1706-1725,共20页
In erasure-coded storage systems,updating data requires parity maintenance,which often leads to significant I/O amplification due to“write-after-read”operations.Furthermore,scattered parity placement increases disk ... In erasure-coded storage systems,updating data requires parity maintenance,which often leads to significant I/O amplification due to“write-after-read”operations.Furthermore,scattered parity placement increases disk seek overhead during repair,resulting in degraded system performance.To address these challenges,this paper proposes a Cognitive Update and Repair Method(CURM)that leverages machine learning to classify files into writeonly,read-only,and read-write categories,enabling tailored update and repair strategies.For write-only and read-write files,CURM employs a data-differencemechanism combined with fine-grained I/O scheduling to minimize redundant read operations and mitigate I/O amplification.For read-write files,CURM further reserves adjacent disk space near parity blocks,supporting parallel reads and reducing disk seek overhead during repair.We implement CURM in a prototype system,Cognitive Update and Repair File System(CURFS),and conduct extensive experiments using realworld Network File System(NFS)and Microsoft Research(MSR)workloads on a 25-node cluster.Experimental results demonstrate that CURMimproves data update throughput by up to 82.52%,reduces recovery time by up to 47.47%,and decreases long-term storage overhead by more than 15% compared to state-of-the-art methods including Full Logging(FL),ParityLogging(PL),ParityLoggingwithReservedspace(PLR),andPARIX.These results validate the effectiveness of CURM in enhancing both update and repair performance,providing a scalable and efficient solution for large-scale erasure-coded storage systems. 展开更多
关键词 Erasure coding machine learning cognitive update and repair I/O amplification mitigation seekefficient recovery
暂未订购 下载PDF
Erratum:“Data-driven Simulations of Magnetic Field Evolution in Active Region 11429:Magneto-frictional Method Using PENCIL CODE”(2024,RAA,24,025007) 认领 引用
10
作者 P.Vemareddy Jön Warnecke Ph.A.Bourdin 《Research in Astronomy and Astrophysics》 SCIE CAS CSCD 2026年第3期293-293,共1页
On page 6,Figure 3 is a duplicate of Figure 4.We publish below the correct figure,sincerely apologizing to the authors.
关键词 magnetic field evolution magneto frictional method pencil code erratum figure duplication apology active region
暂未订购 下载PDF
Genomic insights into the survival code of karst plants 认领 引用
11
作者 Xiongfang Liu Yongpeng Ma 《Plant Diversity》 SCIE CAS CSCD 2026年第2期227-230,共4页
Karst landscapes are developed on soluble rocks(primarily limestone),covering about 10-15%of Earth’s ice-free land surface(Ford and Williams,2007).Their unique geological properties have given rise to complex,heterog... Karst landscapes are developed on soluble rocks(primarily limestone),covering about 10-15%of Earth’s ice-free land surface(Ford and Williams,2007).Their unique geological properties have given rise to complex,heterogeneous,and“island-like”habitats that,combined with periodic drought,high calcium,and lownutrient stresses,foster high species diversity and endemism(Clements et al.,2006;Hao et al.,2015;Oliver et al.,2017;Monro et al.,2018).These conditions make karst ecosystems ideal“natural laboratories”for studying speciation and adaptive evolution(Clements et al.,2006;Oliver et al.,2017). 展开更多
关键词 soluble rocks soluble rocks primarily karst ecosystems genomic insights survival code karst plants limestone ice free land surface
暂未订购 下载PDF
An empirical study on cross-phase code modification behaviors in incremental programming projects 认领 引用
12
作者 Jing Jiang Chenhong Ji +1 位作者 Li Zhang Haiyan Yang 《计算机教育》 2026年第6期280-291,共12页
This paper conducts an empirical study on students'code modification behaviors in incremental programming projects by analyzing 40771 code submissions from 371 students through abstract syntax tree(AST)difference ... This paper conducts an empirical study on students'code modification behaviors in incremental programming projects by analyzing 40771 code submissions from 371 students through abstract syntax tree(AST)difference analysis and manual annotation.The study investigates the distribution of code modification types to prior-phase code during iterative development,identifies cross-phase error types,and analyzes refactoring strategies.The findings reveal that error correction and code refactoring constitute the primary types of cross-phase code modifications.Among cross-phase latent errors,special case neglect represents the dominant error type,indicating insufficient coverage of special scenarios in existing test suites.Variable renaming emerges as the most prevalent refactoring behavior,reflecting students'emphasis on code readability.These research findings provide empirical evidence for optimizing incremental curriculum design,improving test cases,and cultivating students'code maintenance capabilities in programming education. 展开更多
关键词 Incremental projects Code modification Error correction Code refactoring Computer science education
暂未订购 下载PDF
Methods,Algorithms,Codes,and Software for Theoretical and Computational Chemistry 认领 引用
13
作者 Bin Jiang 《Chinese Journal of Chemical Physics》 SCIE EI CAS CSCD 2026年第3期301-302,共2页
Theoretical and computational chemistry has profoundly impacted a wide range of disciplines,from chemistry and physics to biology and materials science.In recent years,remarkable advances in electronic structure theor... Theoretical and computational chemistry has profoundly impacted a wide range of disciplines,from chemistry and physics to biology and materials science.In recent years,remarkable advances in electronic structure theory,molecular dynamics,and machine learning methods——coupled with increasingly powerful algorithms and software—have equipped chemists with an unprecedented arsenal of tools to tackle complex chemical problems. 展开更多
关键词 theoretical computational chemistry electronic structure theorymolecular dynamicsand algorithms codes software methods materials sciencein theoretical chemistry
暂未订购 下载PDF
CoDefense:面向对抗性攻击的多粒度代码归一化防御方法 认领 引用
14
作者 田朝 邝仕琦 +2 位作者 闫明 王海弛 陈俊洁 《软件学报》 EI CSCD 北大核心 2026年第3期1170-1196,共27页
近年来,以代码为输入的预训练模型在许多基于代码的关键任务中取得了显著的性能优势,但这类模型可能容易受到通过保留语义的代码转换实现的对抗性攻击,这种攻击会显著降低模型鲁棒性并可能进一步引发严重的安全问题.尽管已有对抗性训练... 近年来,以代码为输入的预训练模型在许多基于代码的关键任务中取得了显著的性能优势,但这类模型可能容易受到通过保留语义的代码转换实现的对抗性攻击,这种攻击会显著降低模型鲁棒性并可能进一步引发严重的安全问题.尽管已有对抗性训练方法通过生成对抗性样本作为增强数据来提升模型鲁棒性,但其有效性和效率在面对不同粒度和策略的未知对抗性攻击时仍显不足.为了克服这一局限性,提出一种基于代码归一化的预训练代码模型对抗性防御方法CoDefense.该方法的核心思想是作为代码模型的一个前置数据处理模块,通过多粒度代码归一化技术,对训练阶段的原始训练集和推理阶段的代码输入进行归一化预处理,以避免潜在对抗性样本对代码模型的影响.这种策略能够高效地防御不同粒度和策略的对抗性攻击.为验证CoDefense的有效性和效率,针对3种先进的对抗性攻击方法、3种流行的预训练代码模型以及3个基于代码的分类和生成任务,共设计了27个实验场景进行全面的实证研究.实验结果表明,CoDefense相较于最先进的对抗性训练方法,在防御对抗性攻击方面显著提升了有效性和效率.具体而言,CoDefense平均成功防御了95.33%的对抗性攻击.同时,在时间效率上,CoDefense相对于对抗性训练方法平均提升了85.86%. 展开更多
关键词 对抗性防御 预训练代码模型 深度学习
暂未订购 下载PDF
Integration of Large Language Models(LLMs)and Static Analysis for Improving the Efficacy of Security Vulnerability Detection in Source Code 认领 引用 被引量：1
15
作者 José Armando Santas Ciavatta Juan Ramón Bermejo Higuera +3 位作者 Javier Bermejo Higuera Juan Antonio Sicilia Montalvo Tomás Sureda Riera Jesús Pérez Melero 《Computers, Materials & Continua》 SCIE EI 2026年第3期351-390,共40页
As artificial Intelligence(AI)continues to expand exponentially,particularly with the emergence of generative pre-trained transformers(GPT)based on a transformer’s architecture,which has revolutionized data processin... As artificial Intelligence(AI)continues to expand exponentially,particularly with the emergence of generative pre-trained transformers(GPT)based on a transformer’s architecture,which has revolutionized data processing and enabled significant improvements in various applications.This document seeks to investigate the security vulnerabilities detection in the source code using a range of large language models(LLM).Our primary objective is to evaluate the effectiveness of Static Application Security Testing(SAST)by applying various techniques such as prompt persona,structure outputs and zero-shot.To the selection of the LLMs(CodeLlama 7B,DeepSeek coder 7B,Gemini 1.5 Flash,Gemini 2.0 Flash,Mistral 7b Instruct,Phi 38b Mini 128K instruct,Qwen 2.5 coder,StartCoder 27B)with comparison and combination with Find Security Bugs.The evaluation method will involve using a selected dataset containing vulnerabilities,and the results to provide insights for different scenarios according to the software criticality(Business critical,non-critical,minimum effort,best effort)In detail,the main objectives of this study are to investigate if large language models outperform or exceed the capabilities of traditional static analysis tools,if the combining LLMs with Static Application Security Testing(SAST)tools lead to an improvement and the possibility that local machine learning models on a normal computer produce reliable results.Summarizing the most important conclusions of the research,it can be said that while it is true that the results have improved depending on the size of the LLM for business-critical software,the best results have been obtained by SAST analysis.This differs in“NonCritical,”“Best Effort,”and“Minimum Effort”scenarios,where the combination of LLM(Gemini)+SAST has obtained better results. 展开更多
关键词 AI+SAST secure code LLM benchmarking LLM vulnerability detection
暂未订购 下载PDF
Rateless Polar Codes with Unequal Error Protection Property 认领 引用
16
作者 Cui Chen Xiang Wei +1 位作者 Ma Siwei Guo Qing 《China Communications》 SCIE EI CSCD 2026年第1期10-23,共14页
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. 展开更多
关键词 matrix extension polar codes rateless coding unequal error protection
暂未订购 下载PDF
New binary quantum stabilizer codes from classical quasi-cyclic codes of index two 认领 引用
17
作者 Zhen-Hui Zhang Zhuo Li Li-Juan Xing 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第4期253-264,共12页
We study the algebraic structures of a generalized class of quasi-cyclic codes of index two,and prove that any quasicyclic code of index two can be transformed into our proposed quasi-cyclic codes.We determine the gen... We study the algebraic structures of a generalized class of quasi-cyclic codes of index two,and prove that any quasicyclic code of index two can be transformed into our proposed quasi-cyclic codes.We determine the generator forms of the proposed quasi-cyclic codes and their Hermitian dual codes.We establish the necessary and sufficient conditions for Hermitian self-orthogonality and dual-containing property to construct quantum stabilizer codes via the Hermitian construction method.As an application,10 record-breaking quantum stabilizer codes are constructed. 展开更多
关键词 quasi-cyclic codes quantum stabilizer codes Hermitian inner product Hermitian construction
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈