Filters








281,156 Hits in 3.5 sec

Characters and the equivalence of codes

Harold N. Ward, Jay A. Wood
1996 Journal of combinatorial theory. Series A  
We present a new proof based on the linear independence of group characters. We also present a new proof of a theorem of Bonisoli characterizing constant weight codes.  ...  MacWilliams proved that two linear codes are equivalent up to monomial transformations if and only if there is a weight-preserving linear isomorphism between them.  ...  Since composites and inverses of monomial transformations are themselves monomial, it is easy to see that this notion of equivalence is an equivalence relation on linear codes in K".  ... 
doi:10.1016/s0097-3165(96)80011-2 fatcat:zbyjxfv24ncxdeu2kwyrllnlcq

Character Encoding of Classical Languages [chapter]

James K. Tauber, Monica Berti
2019 Digital Classical Philology  
This chapter will start with a conceptual overview of character coding systems and the Unicode Standard in particular but will discuss practical issues relating to the input, interchange, processing and  ...  Underlying any processing and analysis of texts is the need to represent the individual characters that make up those texts.  ...  Unicode distinguishes two types of equivalence: canonical and compatibility. Canonical equivalence means that two (sequences of) code points should essentially be considered the same.  ... 
doi:10.1515/9783110599572-009 fatcat:lokmrt4zb5gd3o4ylicq3rh3ue

Caesar Cipher with Goldbach Code Compression for Efficient Cryptography

Jan Carlo T. Arroyo
2020 International Journal of Emerging Trends in Engineering Research  
To improve the cipher's security feature, the result of the Caesar cipher is encrypted and is compressed using the Goldbach code algorithm.  ...  For the Caesar cipher, each character of a message is always replaced by the same fixed character that has been predetermined.  ...  Map the two primes to the list of prime numbers > 2 to retrieve the equivalent codeword in binary format. f. Repeat steps d and e until all characters are in the G0 code format. g.  ... 
doi:10.30534/ijeter/2020/19872020 fatcat:uybgecrulrc5vbv2tvb6rkmyii

Page 317 of Communications of the Association for Computing Machinery Vol. 3, Issue 5 [page]

1960 Communications of the Association for Computing Machinery  
If we are to perform a transliteration, then the table of equivalents cannot be of the character-to-character type, as in a transposition cipher.  ...  As soon as a numeral is encountered in the text, it is necessary to ‘‘shift’’ to the other table of equivalents and the numbers character is transmitted to indicate this change.  ... 

Component Coding, Three-Item Coding, and Consensus Methods

David M. Williams, Christopher J. Humphries
2003 Systematic Biology  
THREE-ITEM CODING If the cladogram A(B(C(DE))) is represented by three binary characters equivalent to the three components A(BCDE), AB(CDE), and ABC(DE), these characters yield a total of 15 three-item  ...  This finding raises the question of whether component coding, Purvis coding, and multistate coding are equivalent simply because they yield the same correct cladogram.  ... 
doi:10.1080/10635150309337 fatcat:q44xl7ky4batde7r3zq7tu7i2i

Component Coding, Three-Item Coding, and Consensus Methods

David M. Williams, Christopher J. Humphries, Peter Linder
2003 Systematic Biology  
THREE-ITEM CODING If the cladogram A(B(C(DE))) is represented by three binary characters equivalent to the three components A(BCDE), AB(CDE), and ABC(DE), these characters yield a total of 15 three-item  ...  This finding raises the question of whether component coding, Purvis coding, and multistate coding are equivalent simply because they yield the same correct cladogram.  ... 
doi:10.1080/10635150390192753 pmid:12746151 fatcat:6bzn4lbadjai5bru4txctpe4si

An adaptive character wordlength algorithm for data compression

Hussein Al-Bahadili, Shakir M. Hussain
2008 Computers and Mathematics with Applications  
the binary codes are generated based on the estimated probability of the character within the file.  ...  In such techniques, the characters in the source file are converted to a binary code, where the most common characters in the file have the shortest binary codes, and the least common have the longest;  ...  The distribution of characters within the file, and the equivalent binary code used for each character. However, further research studies are required to explore the effect of these factors.  ... 
doi:10.1016/j.camwa.2007.05.014 fatcat:dv3f3v3qjrfg5ep73sikx7zlma

Providing a Distance Bounding Protocol Named Pasargad in order to Defend against Relay Attacks on RFID-Based Electronic Voting System

Mohammad Arjmand, Mahmoud Gardeshi, Reza Taheri zohur, Mohammad Kazemi
2011 International Journal of UbiComp  
The most important characteristic of RFID-based electronic voting system compared to traditional voting system is that votes in the electronic system are as contactless smart cards in place of paper ballots  ...  The most important threat for RFIDsystems is information robbery and relay attacks.  ...  ACKNOWLEDGEMENTS In the end, we are very grateful to International Saba pooyan Asia Company and Tehran branch of ICT Telecommunication Office for their support of this article.  ... 
doi:10.5121/iju.2011.2305 fatcat:bfxdqpsqqnd4lo6zpckuvn7nu4

Representing group codes as permutation codes

E. Biglieri, J.K. Karlof, E. Viterbo
1999 IEEE Transactions on Information Theory  
We show that every group code is (weakly) equivalent to a permutation code and we discuss the minimal degree of this permutation code. * J. Karlof is with the Mathematical  ...  In this paper a new concept of equivalence of codes of different dimensions is presented which is weaker than the usual definition of equivalent codes.  ...  Let χ φ be the character of φ and suppose χ φ = p i=1 b i χ i . If φ is faithful and b i ≥ a i ∀i, then Γ generates a permutation code equivalent to X .  ... 
doi:10.1109/18.782174 fatcat:qlqi55kp4jcxlcjbiccagwxyyu

Page 7 of Hewlett-Packard Journal Vol. 32, Issue 1 [page]

1981 Hewlett-Packard Journal  
Each character is represented by a combination of five bars that are each one or three units wide (see Table |). pattern (tag) on the paper are equivalent to the high and low logic levels of the electrical  ...  An analogy for how bar-code systems work is to consider a printed bar code as a pulse-code-modulated (PCM) signal where linear distance on the paper is equivalent to time and the white and black reflectance  ... 

Page 164 of Library Resources & Technical Services Vol. 44, Issue 3 [page]

2000 Library Resources & Technical Services  
One’s first reaction is to think about characters as equivalent to the exact glyphic form, because that is what we LRTS 44(2) Sixteen-bit character codes Unicode character codes are 16 bits.  ...  Plain text Plain text is a pure sequence of character codes Logical order Logical order underpins the correct presentation of text.  ... 

A Decision Procedure for String to Code Point Conversion [chapter]

Andrew Reynolds, Andres Nötzli, Clark Barrett, Cesare Tinelli
2020 Lecture Notes in Computer Science  
We describe our implementation of this approach in the SMT solver CVC4, which contains a high-performance string subsolver, and show that the use of a native procedure for code points significantly improves  ...  We present a decision procedure for a concatenation-free theory of strings that includes length and a conversion function from strings to integer code points.  ...  If x and y are different, then they must differ at some smallest position k. The value of r is equivalent to the comparison of code(x k ) and code(y k ).  ... 
doi:10.1007/978-3-030-51074-9_13 fatcat:y6q4uhzpzbeinj3ebstamy4vtm

Analyzing exotic instructions for a retargetable code generator

Thomas M. Morgan, Lawrence A. Rowe
1982 SIGPLAN notices  
The analysis uses source-to-source transformations to prove the equivalence of high-level language operators to exotic instructions. Examples are presented which illustrate the analysis process.  ...  Recent retargetable code generator and instruction set analysis systems have not dealt with exotic instructions.  ...  If the character is found, the zf condition code is set and d~ contains the address of the character which follows the character that was found.  ... 
doi:10.1145/872726.806995 fatcat:e5533o5kvbebpg4t3qdkpl4uka

Fast and Precise Sanitizer Analysis with BEK

Pieter Hooimeijer, Benjamin Livshits, David Molnar, Prateek Saxena, Margus Veanes
2011 USENIX Security Symposium  
equivalence between all pairs of a set of implementations of HTMLEncode.  ...  BEK is a language and system for writing sanitizers that enables precise analysis of sanitizer behavior, including checking idempotence, commutativity, and equivalence.  ...  This ensures that the code analyzed and tested is functionally equivalent to the code which is actually deployed for sanitization, up to bugs in our compilation.  ... 
dblp:conf/uss/HooimeijerLMSV11 fatcat:huglp6gkdrhwxpsrjzytchwbji

Novel bit-level Adaptive and Asymmetric Data Compression Technique

Shashwat Tiwari, Ayushi Lal, Shivani Agarwal, Ayush Kumar, Anupam Singh, Nitin Arora
2020 International Journal of Computer Applications  
This paper works on a detailed and per-formative evaluation of a bit-level, adaptive, and asymmetric data compression scheme that is based on the adaptive character word length algorithm.  ...  In this mathematical technique, the data word is converted into codewords (Binary form) then the binary coded file is compressed using 8 bits character word length.  ...  The equivalent binary code used for each character. ( ) 1 The compression ratio is calculated using eq. 1.  ... 
doi:10.5120/ijca2020919832 fatcat:q6owpmcstvbs3lapieu7hdx5km
« Previous Showing results 1 — 15 out of 281,156 results