Information reconciliation for erasure channels

dc.contributor.advisorZimand, Marius
dc.contributor.authorSherbert, Kyle
dc.contributor.departmentTowson University. Department of Computer and Information Sciencesen_US
dc.date.accessioned2017-11-02T21:09:48Z
dc.date.available2017-11-02T21:09:48Z
dc.date.issued2017-11-02
dc.date.submitted2017-05
dc.description(M.S.) -- Towson University, 2017en_US
dc.description.abstractSay Alice and Bob have n-bit strings which are identical except that Bob's contains t "erasures": the corresponding bit may be either zero or one. Alice will send Bob a message he can use to fill in his erased bits. The Slepian-Wolf bound suggests Alice may send as few as t bits, even when Alice does not know which t bits of are erased. We present several protocols acheiving this bound with varying degrees of success. A binary, linear, and deterministic protocol exists only for t ϵ {0, 1, n-1, n}. A nonbinary protocol exists for any t ≤ n ≤ 2m-1, but requires that erasures occur in m-bit blocks. A nonlinear protocol seems promising, but the theory to prove it in general is difficult to explore. Finally, a probabilistic protocol has no parameter constraints, but has suboptimal communication complexity based on an additional parameter c, and will fail with an error-rate Є dependent on c and t.en_US
dc.description.urihttp://library.towson.edu/digital/collection/etd/id/60390en_US
dc.formatapplication/pdf
dc.format.extentix, 67 pagesen_US
dc.genrethesesen_US
dc.identifierdoi:10.13016/M2HT2GD10
dc.identifier.otherTSP2017Sherbert
dc.identifier.urihttp://hdl.handle.net/11603/7405
dc.language.isoen_USen_US
dc.titleInformation reconciliation for erasure channelsen_US
dc.typeTexten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TSP2017Sherbert_Redacted.pdf
Size:
747.63 KB
Format:
Adobe Portable Document Format
Description:
Sherbert Thesis
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.45 KB
Format:
Item-specific license agreed upon to submission
Description: