Tag: coding-theory

Found 61 results for 'coding-theory'.

1) symmetric - Reed Solomon secret sharing and as a one-time symmetric key?
2) secret-sharing - RS Erasure Coding and Shamir's Secret Sharing
3) reference-request - The length of non perfect binary 1 error correcting codes
4) ds.algorithms - fast range summable hash functions
5) reference-request - Relation between group theory and information theory
6) cc.complexity-theory - Coding theory and complete problems
7) graph-theory - Are there Similar Distance Binary Error Correcting Codes?
8) cc.complexity-theory - Can Quarter-Subset Membership be decided space-efficiently?
9) coding-theory - How many different Huffman encoding for a given number of symbols
10) cc.complexity-theory - On the need for a self-correcting function in the PCP theorem
11) pr.probability - Subspace-evasive set performance in the random case
12) it.information-theory - Notation of sequences in rate distortion theory
13) coding-theory - Ambivalent Coding
14) optimization - How good is the Huffman code when there are no large probability letters?
15) coding-theory - Are there good locally decodable _erasure_ codes
16) co.combinatorics - Solvability of matrix filling
17) co.combinatorics - Transposition of any characters in Damerau–Levenshtein edit distance computation
18) it.information-theory - Explicit Bits-back Coding (a.k.a. Free Energy Coding) applied to Gaussian mixtures
19) coding-theory - Non-random errors with a Reed Solomon code
20) co.combinatorics - Families of LDPC codes with constant error fraction corrected
21) co.combinatorics - Upperbound on cardinality of product of two string sets at pairwise Hamming distance $> 1$
22) reference-request - Reference request: Classical analog of quantum threshold theorem
23) group-theory - Representation theory in cryptography/coding theory
24) cryptanalysis - Where can I find useful data for cryptography/coding theory?
25) it.information-theory - Surveys on Network Coding
26) cc.complexity-theory - reduction of maximum independet set to minimum distance of code
27) it.information-theory - Source Coding Theorem: what happen when we go below N*H(x) bits?
28) big-list - Asymptotically good codes
29) co.combinatorics - The noise distribution on $F_2^n$: probability of landing in a subspace versus a coset
30) ds.algorithms - Is subtractive dithering the optimal algorithm for sending a real number using one bit?
31) co.combinatorics - Boolean error correcting code over $\mathbb{F}_q$
32) linear-algebra - Why are folded Reed Solomon Codes considered non linear?
33) coding-theory - Bounds for maximum number of code-words in a ternary error correcting code with length n and distance d?
34) it.information-theory - Why Asymptotic Equipartition Property theorem proofs assume the source is memoryless?
35) ds.algorithms - Maximum subset of words with Hamming distance ≥ D
36) coding-theory - Dual BCH codes of design distance $d$
37) co.combinatorics - Is there a lower bound of number of redundant bits necessary to encode a word with certain Hamming distance?
38) reference-request - Reference Request: Error correction code for a random projection
39) coding-theory - Distance of arbitrary vectors to Hadamard code
40) reference-request - Implementing the Mceliece Encryption - making the Generator Matrix
41) coding-theory - Can Reed-Solomon codes work on infinite fields like $\mathbb{Q}$?
42) public-key - Coding gain and minimum determinant in cryptography
43) cryptanalysis - Why is the nonlinearity of this Boolean function evaluating to $\frac12$?
44) coding-theory - Unique decoding Radius in Reed Solomon Codes
45) mac - Does there exist a proof-of-retrievability scheme that is publicly-verifiable, limited-use, and does not use homomorphic encryption?
46) resources - Hermitian curves introductory references
47) coding-theory - How to solve the system of linear equations to recover original file using "Erasure Coding"?
48) encoding - Can Reed Solomon parity blocks be used as an all-or-nothing transform?
49) it.information-theory - Gift bits when encoding a sequence of messages, how is that?
50) hardness-assumptions - Hardness of LPN problem with small secret