Binary prefix - PDFSEARCH.IO - Document Search Engine

Binary prefix
Results: 23

#	Item
1	Sparse Data Blocks and Multi-User Channels Edward A. Ratzer Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE, UK Phone: +Email: October 25, 2002 Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2003-03-05 13:32:57 Coding theory Error detection and correction Information theory Discrete mathematics Mathematics Low-density parity-check code Forward error correction Binary symmetric channel Noisy-channel coding theorem Linear code Prefix code Huffman coding
2	374 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 23, NO. 2, FEBRUARY 2015 Reverse Converter Design via Parallel-Prefix Adders: Novel Components, Methodology, and Implementations Add to Reading List Source URL: www.inesc-id.pt Language: English - Date: 2015-08-24 04:33:50 Computer arithmetic Adder Binary logic 2N Integrated circuit Carry-save adder
3	Catch Me If You Can: A Practical Framework to Evade Censorship in Information-Centric Networks Reza Tourani Satyajayant Misra Add to Reading List Source URL: conferences2.sigcomm.org Language: English - Date: 2015-10-01 13:18:53 Binary trees Information theory Computing Information Coding theory Huffman coding Entropy Prefix code Anonymizer Code Data compression Redundancy
4	2001 Paper 9 Question 10 Information Theory and Coding (a) (i ) Construct an efficient, uniquely decodable binary code, having the prefix property and having the shortest possible average code length per symbol, for an Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-06-09 10:17:44
5	2008 Paper 8 Question 9 Information Theory and Coding (a) (i ) A variable-length, uniquely decodable code that has the prefix property and whose N binary code word lengths are n1 ≤ n2 ≤ n3 ≤ · · · ≤ nN must s Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-06-09 10:18:26 Telecommunications engineering Autocorrelation Code Sampling Noise Triple correlation Signal processing Statistics Applied mathematics
6	Solution: Microsoft Exchange 2007, 2010 and 2013 Versions supported: Add to Reading List Source URL: www.heroix.com Language: English - Date: 2014-12-05 08:36:39 Central processing unit Page Email C dynamic memory allocation Digital media Binary prefix Memory management Computing Computer hardware
7	A Case Study in Building Layered DHT Applications Paper #318 Abstract Recent research has convincingly demonstrated that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. On Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2005-09-01 19:45:26 Distributed hash table Prefix hash tree Peer-to-peer Chord Trie P-Grid B-tree Binary search tree Hash table Distributed data storage Computing Computer programming
8	Motivation Statement of the problem Dense-tree encodings Prefix rules and essential rules Bounds on the size of templates representing intervals Results Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-07-30 17:28:54 Binary tree Interval tree String Interval Exponentiation Gray code Integer Code Mathematics Abstract algebra Formal languages
9	Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar {hasanj, vijay} @ecn.purdue.edu Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-07-14 13:20:18 Trie Radix tree Distributed data storage Binary search tree Longest prefix match Routing B-tree Ctrie Radix sort Computing Network architecture Internet
10	A Case Study in Building Layered DHT Applications Yatin Chawathe† Sriram Ramabhadran∗ Sylvia Ratnasamy‡ Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2005-06-20 15:46:58 Distributed hash table Prefix hash tree Chord Peer-to-peer Trie P-Grid B-tree Binary search tree Binary tree Distributed data storage Computing Computer programming

UPDATE