The study of data representations that enable error detection, error correction and/or compression.
-1
votes
2answers
64 views
Network modem question
How would I solve the following can anyone help me.I know MIPS is basically how many instruction the processor can do per second but what should I do?
Assume that we are receiving a message across a ...
3
votes
1answer
80 views
Algorithm for determining minimal set of covering prefixes
I have a set of strings. My goal is to find a minimal set of longest prefixes which will match most of that set.
For instance, if my set is:
...
5
votes
1answer
80 views
Application of Expander Codes
I need to give a talk about expander codes at university (I'm a student of computer science). Since they have been introduced to show a family of codes looking good when thinking of the Shannon ...
5
votes
3answers
243 views
No compression algorithm can compress all input messages?
I just started reading a book called Introduction to Data Compression, by Guy E. Blelloch. On page one, he states:
The truth is that if any one message is shortened by an algorithm, then some ...
5
votes
2answers
166 views
What is a good binary encoding for $\phi$-based balanced ternary arithmetic algorithms?
I've been looking for a way to represent the golden ratio ($\phi$) base more efficiently in binary. The standard binary golden ratio notation works but is horribly space inefficient. The Balanced ...
6
votes
1answer
106 views
Prove fingerprinting
Let $a \neq b$ be two integers from the interval $[1, 2^n].$ Let $p$ be a random prime with $ 1 \le p \le n^c.$ Prove that
$$\text{Pr}_{p \in \mathsf{Primes}}\{a \equiv b \pmod{p}\} \le c ...
0
votes
0answers
59 views
Calculating parity bits [duplicate]
Possible Duplicate:
Encoding the sequence 0110 and determining parity, data bit and value
I recently had some difficulty working out examples on parity bits and received a very detailed ...
3
votes
1answer
150 views
Encoding the sequence 0110 and determining parity, data bit and value
I've been struggling with several Hamming code/error detection questions because the logic behind it doesn't seem to make sense.
eg.1
eg.2
I don't really understand the above two examples and ...
8
votes
1answer
129 views
Error-correcting rate is misleading
In coding theory, 'how good a code is' means how many channel errors can be corrected, or better put, the maximal noise level that the code can deal with.
In order to get better codes, the codes are ...
