[PDF] Top 20 Optimal Codes and Entropy Extractors
Has 10000 "Optimal Codes and Entropy Extractors" found on our website. Below are the top 20 most common "Optimal Codes and Entropy Extractors".
Optimal Codes and Entropy Extractors
... Coding Theory deals with the problem of safe communication: signals sent through a noisy channel can indeed be corrupted and therefore reach their destination with some errors. In order to protect the information ... See full document
198
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters
... AMD codes can be used to turn any linear secret sharing scheme into a so called robust secret sharing scheme [TW89], which en- sures that no unqualified subset of players can modify their shares and cause the ... See full document
14
FPGA Implementation of High Performance Entropy Encoder for H.264 Video CODEC
... An entropy encoding is a lossless data compression scheme that is independent of the specific characteristics of the ...of entropy coding creates and assigns a unique prefix-free code to each unique symbol ... See full document
7
Privacy Amplification with Asymptotically Optimal Entropy Loss
... of extractors with asymptotically optimal seed length [12] and through the analysis of Kanukurthi and Reyzin [15], it can be seen that the protocol of [24] achieves entropy loss of Θ(κ 2 ) and takes ... See full document
26
Non-malleable Randomness Encoders and their Applications
... In this work, we introduce Non-malleable Randomness Encoders. Informally, NMREs allow for the generation of randomness r along with its correspond- ing non-malleable encoding C. The non-malleability is, as for standard ... See full document
30
Amplifying Privacy in Privacy Amplification
... 2-round, optimal entropy loss protocol of [Li12b, Theorem ...non-malleable extractors. Moreover, by making all extractors in that protocol locally computable, we get a locally computable, ... See full document
26
Non-Malleable Condensers for Arbitrary Min-Entropy, and Almost Optimal Protocols for Privacy Amplification
... achieves entropy loss O(s). Dodis and Wichs [DW09] showed that optimal protocols can be achieved by constructing explicit non-malleable ...non-malleable extractors for smaller min-entropy may ... See full document
37
Non-Malleable Extractors, Two-Source Extractors and Privacy Amplification
... of entropy, while the best two-source extractor to date can only achieve entropy slightly below n/2 ...small entropy k requires O(log n/ log k) inde- pendent sources [Rao06, ...the entropy ... See full document
54
Optimal design of water distribution systems based on entropy and topology
... n-bit codes and, depending on the number of decision variables, some codes may be ...redundant codes represent closed pipes whose flow-carrying capacity is ... See full document
21
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space
... yields optimal compression for random BSTs, but is not a good choice for certain other shape ...Huffman codes that no other tree-covering-based data structure can use less ... See full document
16
Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
... randomness extractors has been a great success, resulting in ex- citing new techniques, new connections, and breakthroughs to long standing open problems in several seemingly different ...non-malleable ... See full document
53
Adaptive iterative decoding : block turbo codes and multilevel codes
... A sub-optimal reduced-complexity SISO decoder is described in section 2.3 which allows long block codes to be used as component codes in a block Turbo code with manageable decoding compl[r] ... See full document
194
Optimal, Divisible binary Codes from Gray-Homogeneous Images of Codes over R_{k,m}
... cyclic codes over rings, in particular over finite chain ...cyclic codes. Instead we will demonstrate how some one- generator cyclic codes over these rings lead to optimal divisible binary ... See full document
12
Weighted external difference families and R optimal AMD codes
... (AMD) codes were introduced in the cryptographic literature by Cramer, Dodis, Fehr, Padr´ o and Wichs as a tool with a range of cryptographic ...AMD codes [1, 6, 7, ... See full document
17
Weighted external difference families and R optimal AMD codes
... (AMD) codes were introduced in the cryptographic literature by Cramer, Dodis, Fehr, Padr´ o and Wichs as a tool with a range of cryptographic ...AMD codes [1, 6, 7, ...AMD codes, including ... See full document
20
When are Fuzzy Extractors Possible?
... with entropy rate up to µ = ...of entropy. Thus, showing impossibility for higher entropy rates raises the lower bound on how much fuzzy min-entropy must be present in the physical ... See full document
32
Learning 5000 Relational Extractors
... Large-scale extraction A popular approach to IE is supervised learning of relation-specific extrac- tors (Freitag, 1998). Open IE, self-supervised learning of unlexicalized, relation-independent ex- tractors (Banko et ... See full document
10
On the Limitations of Computational Fuzzy Extractors
... First, we observe that the result of [6] can be applied to computational fuzzy extractors under some condition. The condition is that for the generation procedure Gen, there is an efficient inverter that, on input ... See full document
8
Daskalov
... the optimal codes is very difficult one (see [15], [9]) and has two aspects - one is the construction of new codes with better minimum distances and the other is to prove the nonexistence of ... See full document
6
Daskalov
... linear codes with large dimension, it is natural to focus one’s effort on subclasses of linear codes, having rich mathematical ...(QC) codes are known to have such a structure and it has been shown ... See full document
8
Related subjects