OFFSET
1,2
COMMENTS
An arbitrary message of n bits may be overwritten by another arbitrary message of n bits on a write-once memory using k*n bits using the Rivest-Shamir encoding. - Charles R Greathouse IV, Jul 29 2015
LINKS
Robert G. Wilson v, Table of n, a(n) for n = 1..1000
Ronald L. Rivest and Adi Shamir, How to Reuse a "Write-Once" Memory, 1982
EXAMPLE
1.29381537334041549331660165330365735214536165414747114457004559339173...
MATHEMATICA
RealDigits[ 1/(1 - FindRoot[p*Log2[1/p] + (1 - p)*Log2[1/(1 - p)] + p == 1, {p, 1/4}, WorkingPrecision -> 2^7][[1, 2]]), 10, 111][[1]] (* Robert G. Wilson v, Aug 04 2015 *)
PROG
(PARI)
default(realprecision, 110);
L(x)=log(x)/log(2);
H(p)=my(q=1-p); p*L(1/p)+q*L(1/q);
t=solve(p=0.22, 0.228, H(p)-(1-p)); \\ 0.22709219521...
1/(1-t) \\ 1.29381537334041...
\\ Joerg Arndt, Aug 03 2015
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Robert C. Lyons and Robert G. Wilson v, Jul 28 2015
EXTENSIONS
More terms from Joerg Arndt, Aug 03 2015
STATUS
approved