982,353 Hits in 2.9 sec

Threaded Code Generation with a Meta-Tracing JIT Compiler [article]

Yusuke Izawa, Hidehiko Masuhara, Carl Friedrich Bolz-Tereick, Youyou Cong
2022 arXiv   pre-print
This paper presents an idea to generate threaded code by reusing an existing meta-tracing JIT compiler, as well as an interpreter design for it.  ...  We measured the potential performance of our threaded code generation by simulating its behavior in PyPy.  ...  Threaded Code Generation with a Meta-Tracing JIT Compiler 11  ... 
arXiv:2106.12496v6 fatcat:cautfmgzxjerzez2fd2bgxncdq

Multimedia IPP Codes with Efficient Tracing [article]

Jing Jiang, Minquan Cheng, Ying Miao, Dianhua Wu
2014 arXiv   pre-print
Several infinite series of optimal q-ary t-SMIPPCs of length 2 with t = 2, 3 are derived from the relationships among t-SMIPPCs and other fingerprinting codes, such as t-separable codes and t-MIPPCs.  ...  In this paper, we first introduce a binary strong multimedia identifiable parent property code (binary t-SMIPPC) whose tracing algorithm is more efficient than that of a binary t-MIPPC.  ...  Therefore, it is desirable to find some special MIPPCs with efficient tracing ability. Definition III.3. Let C be an (n, M, q) code, and t ≥ 2 be an integer.  ... 
arXiv:1411.6841v1 fatcat:sb3mof2z6bfbvm5klowlxvb5zi

Coding for Deletion Channels with Multiple Traces [article]

Mahed Abroshan, Ramji Venkataramanan, Lara Dolecek, Albert Guillén i Fàbregas
2019 arXiv   pre-print
Motivated by the sequence reconstruction problem from traces in DNA-based storage, we consider the problem of designing codes for the deletion channel when multiple observations (or traces) are available  ...  We propose simple binary and non-binary codes based on Varshamov-Tenengolts (VT) codes. The proposed codes split the codeword in blocks and employ a VT code in each block.  ...  Figure 2 shows how the error probability decreases with the number of traces t, for a rate 5 6 binary code with code parameters held fixed. Each trace has 4 deletions.  ... 
arXiv:1905.08197v2 fatcat:o5g5sl6t6ndcves4xxomwoll3e

Trace Codes with Few Weights over F_p+uF_p [article]

Minjia Shi, Yan Liu, Patrick Solé
2016 arXiv   pre-print
Then by using a linear Gray map, we obtain an infinite family of abelian codes with few weights over F_p.  ...  In particular, we obtain an infinite family of two-weight codes which meets the Griesmer bound with equality. Finally, an application to secret sharing schemes is given.  ...  Hence, a code with few weights is a very interesting topic, and has been investigated in [6, 7, 9, 12 ] and many other papers. 5 A classical construction of codes over finite fields called trace codes  ... 
arXiv:1612.00128v1 fatcat:eqn2drhi4va7bo2idag3s7dul4

Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities [article]

Serge Kas Hanna
2022 arXiv   pre-print
Our main contribution is designing a novel code for trace reconstruction that allows reconstructing a coded sequence efficiently from a constant number of traces.  ...  We consider the model where the traces are outputs of independent deletion channels, where each channel deletes each bit of the input codeword 𝐱∈{0,1}^n independently with probability p.  ...  For this regime, the authors in [3] introduced binary codes with rate 1 − O( 1 log n ) that can be efficiently reconstructed from log c n traces, with c > 1.  ... 
arXiv:2207.05126v1 fatcat:izap4h6gavhebeeuzhi3jll2xy

A 2-Secure Code with Efficient Tracing Algorithm [chapter]

Tô Vu Dong, Safavi-Naini Reihaneh, Wang Yejing
2002 Lecture Notes in Computer Science  
We consider c-secure codes with ε error that allow one of the c possible colluders to be traced and the chance of incorrect tracing to be at most ε.  ...  A group of colluders having access to multiple copies with different fingerprints may construct a pirate object with a fingerprint that cannot be traced.  ...  In [4] , with error ε, the inner code has n codeword and length O(n 3 log n/ε), the tracing algorithm may output innocent users.  ... 
doi:10.1007/3-540-36231-2_13 fatcat:ga4m34yny5fq7borsy4zyp2lp4

Coupling extended magnetohydrodynamic fluid codes with radiofrequency ray tracing codes for fusion modeling

Thomas G. Jenkins, Eric D. Held
2015 Journal of Computational Physics  
Sovinec et al., 1626] codes, the approach presented can be applied more generally to any code coupling requiring the mapping of ray tracing data onto Eulerian grids.  ...  The scale separation enables use of the eikonal (ray-tracing) approximation to model the RF wave propagation.  ...  For frequencies near electron cyclotron resonance, a conceptual picture of the salient RF physics can often be attained by tracing only a few rays in accordance with Eqs. (10) - (11) .  ... 
doi:10.1016/ fatcat:ee72yad7z5a3dnkjxmbtf7dqqu

Codes Associated with O(3,2^r) and Power Moments of Kloosterman Sums with Trace One Arguments [article]

Dae San Kim
2011 arXiv   pre-print
Then we obtain a recursive formula for the odd power moments of Kloosterman sums with trace one arguments in terms of the frequencies of weights in the codes C(O(3,q)) and C(Sp(2,q)).  ...  We construct a binary linear code C(O(3,q)), associated with the orthogonal group O(3,q). Here q is a power of two.  ...  trace one arguments in terms of the frequencies of weights in the codes C (O(3, q) ) and C (Sp(2, q) ).  ... 
arXiv:1108.5093v1 fatcat:fczfa7ma4fdi7jinoxwgd3lf7m

Optimized Automatic Code Generation for Geometric Algebra Based Algorithms with Ray Tracing Application [article]

Ahmad Hosney Awad Eid
2016 arXiv   pre-print
The possibility of fully benefiting from the symbolic power of GA while obtaining good performance and maintainability of software implementations is illustrated through a ray tracing application.  ...  A novel GA-based geometric code generator, called GMac, is proposed. Comparisons to similar GA-based code generators are provided.  ...  In addition its good OOP design enables its extension to be used for testing any ray tracing related techniques with minimum integration effort and maximum code reuse.  ... 
arXiv:1607.04767v1 fatcat:4wtwman7srch3mjijl7jcyzmna

Vectorizing Sparse Matrix Codes with Dependency Driven Trace Analysis [article]

Zachary Cetinic, Kazem Cheshmi, Maryam Mehri Dehnavi
2021 arXiv   pre-print
It generates vectorized code for the sparse matrix multiplication kernel (SpMV), a kernel with parallel outer loops, and for kernels with carried dependence, specifically the sparse triangular solver (  ...  DDF outperforms the highly specialized library MKL with an average speedup of 1.93 and 4.5X for SpMV and SpTRSV, respectively.  ...  Vectorizing Sparse Matrix Codes with Dependency Driven Trace Analysis  ... 
arXiv:2111.12243v2 fatcat:3fwcuhyjl5dd5pgxslkte6sbxq

Linear Code Implies Public-Key Traitor Tracing with Revocation [chapter]

Vu Dong Tô, Reihaneh Safavi-Naini
2004 Lecture Notes in Computer Science  
PKC'02, LNCS 2274, pp. 172-187, 2002] that a public-key (k, n)-traitor tracing scheme, called linear-coded Kurosawa-Desmedt scheme, can be derived from an [n, u, d]-linear code such that d ≥ 2k + 1.  ...  In this paper, we show that the linear-coded Kurosawa-Desmedt scheme can be modified to allow revocation of users, that is to show a revocation scheme can be derived from a linear code. Abstract.  ...  Conclusion In this paper, we have shown that from an [n, u, d]-linear code such that d ≥ 2k + 1, it is possible to construct a public-key (k, n)-traitor tracing scheme with revocation.  ... 
doi:10.1007/978-3-540-27800-9_3 fatcat:dyxdw3ngyvhlvaqsaqchfjdcgq

Finite Field Elements with Specified Order and Traces

Stephen D. Cohen
2005 Designs, Codes and Cryptography  
Results of F.Özbudak on the existence of elements in a finite extension of a finite field with specified order and at which given rational functions have specified traces over the ground field are obtained  ...  (l = 1) with arbitrary prescribed traces whenever n ≥ 33.  ...  Assume, however, that it is primitive elements with specified traces that are to be counted, i.e., take l = 1 in Section 2.  ... 
doi:10.1007/s10623-004-1724-2 fatcat:go5oq2tsybf5zbhliwldorm4yi

Ternary Codes Associated with O(3,3^r) and Power Moments of Kloosterman Sums with Trace Nonzero Square Arguments [article]

Dae San Kim
2009 arXiv   pre-print
Then we obtain two recursive formulas for the power moments of Kloosterman sums with "trace nonzero square arguments" in terms of the frequencies of weights in the codes.  ...  In this paper, we construct two ternary linear codes C(SO(3,q)) and C(O(3,q)), respectively associated with the orthogonal groups SO(3,q) and O(3,q). Here q is a power of three.  ...  "trace zero square arguments" and those with "trace nonzero square arguments."  ... 
arXiv:0909.1156v1 fatcat:6a6ct4iisnehripmgl354jpyjy

Modeling relativistic electron beams with finite-element ray-tracing codes

S. Humphries, J. Petillo
1999 Proceedings of the 1999 Particle Accelerator Conference (Cat. No.99CH36366)  
Ray-tracing codes determine self-consistent electric fields in high-current electron devices by an iterative procedure of orbit tracking and space-charge deposition with field recalculation.  ...  With simple rules it is possible to assign boundary currents even in complex structures.  ...  Some ray-tracing codes use finite-difference methods on a regular mesh [2, 3, 4] and others employ finite-element methods [5, 6] .  ... 
doi:10.1109/pac.1999.792921 fatcat:f3yeh6kkqjbjzcwtcn7wawilu4

Fully collusion-resistant traitor tracing scheme with shorter ciphertexts

Jong Hwan Park, Dong Hoon Lee
2010 Designs, Codes and Cryptography  
Also, our scheme supports public tracing and black-box tracing.  ...  In building efficient traitor tracing schemes, reducing ciphertext size is a significant factor since the traitor tracing scheme must handle a larger number of users.  ...  Then, the encryption with short ciphertext is a significant factor. In case of previous t-collusion-resistant schemes, we can achieve traitor tracing schemes with short ciphertext if t is small.  ... 
doi:10.1007/s10623-010-9431-7 fatcat:caiuu43fczhg5o2haeys2fiwom
« Previous Showing results 1 — 15 out of 982,353 results