Vinayak, R <br/><br/>
Efficient constructions of streaming codes 

 - Bangalore :  IISc ,  2022 : 
 - xvi, 206p.  col. ill. ;  29.1 cm * 20.5 cm  e-Thesis  2.325Mb 
<br/><br/> include bibliographic reference and index 
<br/><br/>PhD; 2022; Electrical communication engineering 
<br/><br/> Streaming codes are a class of erasure codes that operate on a stream of packets and enable recovery of dropped or erased packets under a decoding-delay constraint. The primary focus of this thesis is on providing constructions and performance bounds for streaming codes in some settings of practical interest. A secondary focus of this thesis is on coded distributed computation. In the streaming code literature, a sliding window (SW) channel model is often adopted, under which, within any SW of fixed time duration, the channel is permitted to introduce either a single erasure burst or, else, a set of arbitrary erasures. Erasure patterns conforming to this constraint are termed admissible erasure patterns. A streaming code operating on this channel is required to recover from all admissible erasure patterns and, furthermore, do so under a decoding delay constraint.  
<br/><br/><label>Subjects--Topical Terms: </label><br/>Streaming Codes<br/>Coded Computation<br/>Coding Theory
<br/><br/><label>Dewey Class. No.: </label>600  / VIN