More Constructions of 3-Weight Linear Codes by Lingyong Ma, Guanjun Li, Fengyan Liu

“…In this paper, we apply some ternary near-bent and 2-plateaued functions or r-ary functions to construct more 3-weight linear codes, where r is a prime. Moreover, we determine the weight distributions of the resulted linear codes by means of some exponential sums.…”
Get full text

FGBC-iDistance:fine-grained bit-code filter based high-dimensional index by Xin-pan YUAN, Can-fei WANG, Jun LONG, Cheng-yuan ZHANG, Jun-feng MAN

“…In the high-dimensional vector retrieval,distance computation is a very time-consuming operation,the current research trend is to reduce the distance computation using divide and conquer algorithm.iDistance algorithm divides the vector space into subspace of clustering by pivot,BC-iDistance algorithm divides the subspace into 2 partitions in each dimension.A more fine-grained partition algorithm and index structure was proposed,each part corresponded with a unique FGBC code (fine-grained bit code),which realized the candidate sets filtered more precisely.The distance computation times of FGBC-iDistance can be reduced to <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <mfrac> <mn>1</mn> <mrow> <msup> <mn>2</mn> <mrow> <mn>2</mn><mi>d</mi></mrow> </msup> </mrow> </mfrac> </math></inline-formula> of iDistance.The distance computation frequency comparison:FGBC-iDistance≤BC-iDistance≤iDistance.The experiment results show that when the scope radius of the range query is 0.08,FGBC-iDistance distance computation times is about 20,000,which is far less than other algorithms,the running time is also reduced.…”
Get full text

Purifying selection in deeply conserved human enhancers is more consistent than in coding sequences. by Dilrini R De Silva, Richard Nichols, Greg Elgar

“…Non-coding DNA that forms part of the regulatory landscape presents more of a challenge since there is not such a clear-cut distinction between sites under stronger and weaker selective constraint. …”
Get full text

Cracking the code for more effective treatments for hepatocellular carcinomas: Promise and a path for immunovirotherapy by Emil Lou

Get full text

Temporal coding carries more stable cortical visual representations than firing rate over time by Hanlin Zhu, Fei He, Pavlo Zolotavin, Saumil Patel, Andreas S. Tolias, Lan Luan, Chong Xie

“…The stability of temporal codes was more correlated with network functional connectivity than rate coding. …”
Get full text

More than just training: rethinking the paediatric code cart design for better emergency care outcomes by Katherine Innis, Jillian Lewis, Russell B. Pierre, Simone Dundas Byles, Oluwayomi Olugbuyi

Get full text

Convolutional coding for code multiplexing of channels by Rabin Alexey, Rabin Sergei, Ovchinnikov Andrey

“…By examining these advanced coding techniques, the paper contributes to the ongoing development of more robust and efficient channel division methods in digital communications.…”
Get full text

On the Exploration of Quantum Polar Stabilizer Codes and Quantum Stabilizer Codes with High Coding Rate by Zhengzhong Yi, Zhipeng Liang, Yulin Wu, Xuan Wang

“…In this paper, we follow the second intuition and propose a more reasonable quantum polar stabilizer code construction algorithm than any previous ones by using the theory of stabilizer codes. …”
Get full text

ExCS: accelerating code search with code expansion by Siwei Huang, Bo Cai, Yaoxiang Yu, Jian Luo

“…Moreover, models rooted in interaction necessitate querying every piece of code within a voluminous corpus. While these methodologies offer superior accuracy, their online retrieval process is considerably more time-consuming compared to traditional Information Retrieval (IR) techniques. …”
Get full text

Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code by ZHANG Guo-hua, WANG Xin-mei

“…Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code were employed,and hence provided more flexible parameters than the original or sin-gly-extended RS codes.Equivalent to the method from doubly-extended RS code,a straightforward procedure was de-rived,by which given generator polynomial of an RS code,LDPC codes could be constructed directly without pretreat-ment such as double extension and classification of codewords.In the second method,generator polynomials of cyclic MDS codes were utilized in a straightforward manner to build quasi-cyclic LDPC codes with its Tanner graph free of 4-cycles.Experimental results showed that the constructed codes from the two methods perform well over AWGN channels.…”
Get full text

Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code by ZHANG Guo-hua, WANG Xin-mei

“…Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code were employed,and hence provided more flexible parameters than the original or sin-gly-extended RS codes.Equivalent to the method from doubly-extended RS code,a straightforward procedure was de-rived,by which given generator polynomial of an RS code,LDPC codes could be constructed directly without pretreat-ment such as double extension and classification of codewords.In the second method,generator polynomials of cyclic MDS codes were utilized in a straightforward manner to build quasi-cyclic LDPC codes with its Tanner graph free of 4-cycles.Experimental results showed that the constructed codes from the two methods perform well over AWGN channels.…”
Get full text

Code Compliance in Reinforce Concrete Design: A Comparative Study of USA Code (ACI) and Chinese Code (GB) by Lan Zhang, Hao Hu, Yi Fang, Zhenyu Qiang

“…The study also presents a case study and calculates that the United States code uses 8–10% more rebar compared to the Chinese code. …”
Get full text

Cooperative MAC protocol based on network coding and space-time coding by Qian-bin CHEN, Jian LIU, Yong FENG, Lun TANG

“…Aiming at the problems in wireless ad hoc networks,such as relays’ low efficiency caused by cooperation and difficult to meet the different QoS requirements,a co e MAC protocol was proposed based on the combination of network coding and space-time coding(NSTCMAC).Based on NSTCMAC protocol with the combination of Network coding and space-time coding techniques,a kind of cooperative MAC transmission mechanism that could distinguish the type of DATA packet was designed in order to meet the QoS requirements of different types of transm Further more,cooperative transmission mechanism and its performance were analyzed through Markov chain model.When transmitting the non-real-time(NR) packets,network coding was adopted to improve the efficiency of relay nodes; when transmitting the real-time(R) packets,randomized distributed space-time coding(R-DSTC)was used to enhance the reliability of transmission.Simulation results show that NSTCMAC protocol can meet different QoS requirements better,and solve the problem of relays’ low efficiency more effectively,when compared with legacy DCF、COOPMAC and CD-MAC protocol.…”
Get full text

Minimising surface-code failures using a color-code decoder by Asmae Benhemou, Kaavya Sahay, Lingling Lao, Benjamin J. Brown

“…The decoder is obtained by mapping the syndrome of the surface code onto that of the color code, thereby allowing us to adopt more sophisticated color-code decoding algorithms. …”
Get full text

Performance comparison of systematic polar code and non-systematic polar code by Hui LI, Ming YE, Qiang TONG, Jie CHENG, Lijie WANG

“…Polar code in channel coding schemes is a research hotspot in 5G communication field.Polar code is susceptible to error propagation under successive cancellation decoding,and the performance of the code at short and medium block lengths is not ideal.For the problems,the performance difference between systematic polar code and non-systematic polar code was studied under various simulation conditions.Simulation results demonstrate that systematic polar code has advantage over non-systematic polar code in bit error rate performance,and the former are more robust against error propagation than the latter under successive cancellation decoding.The above results are considerable importance from the theoretical values in 5G communication and performance optimization of polar code.…”
Get full text

Multilevel coding scheme based on low-density parity-check codes in DAMB by WANG Jia-qing, YU Xiao-yan, WU Le-nan

“…A multilevel coding（MLC）scheme based on LDPC codes was investigated for digital amplitude modulation broadcasting（DAMB）system.Firstly,code rates of MLC were designed,then a multistage decoding strategy was provided based on reliability information instead of only hard decisions to subsequent decoders.We also found a set of excellent irregular LDPC codes and examined the performance of them in DAMB channels.Simulations show that this scheme is more effective than the rate compatible punctured convolutional（RCPC）coded DAMB system.…”
Get full text

Multilevel coding scheme based on low-density parity-check codes in DAMB by WANG Jia-qing, YU Xiao-yan, WU Le-nan

“…A multilevel coding（MLC）scheme based on LDPC codes was investigated for digital amplitude modulation broadcasting（DAMB）system.Firstly,code rates of MLC were designed,then a multistage decoding strategy was provided based on reliability information instead of only hard decisions to subsequent decoders.We also found a set of excellent irregular LDPC codes and examined the performance of them in DAMB channels.Simulations show that this scheme is more effective than the rate compatible punctured convolutional（RCPC）coded DAMB system.…”
Get full text

Optimizing Pre-Trained Code Embeddings With Triplet Loss for Code Smell Detection by Ali Nizam, Ertugrul Islamoglu, Omer Kerem Adali, Musa Aydin

“…In addition, standard methods for improving code embedding are essential to develop more effective embedding-based systems, similar to augmentation techniques in the image processing domain. …”
Get full text

Deep Clustering of Student Code Strategies Using Multi-View Code Representation (CMVAE) by Zhengting Tang, Shizhou Wang, Liangyu Chen

“…Through a joint optimization of reconstruction loss and clustering loss, the model effectively integrates multiple code representations. Experimental results on C# and Python datasets show that CMVAE outperforms traditional and deep clustering baselines, producing more compact and well-separated clusters. …”
Get full text

Error-correcting codes and genetics by Gérard Battail

“…As a subsidiary hypothesis, we assume moreover they take the form of `nested codes', i.e., that several codes are combined into a layered structure which results in an unequal protection: the older and more fundamental parts of the genomic information are better protected than more recent ones. …”
Get full text